./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-53.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-53.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 be2e40f79fa9aafe544dbfb6b1d1f051df435db5ea0b560bd0fc960acf5ae062 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:38:32,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:38:32,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:38:32,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:38:32,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:38:32,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:38:32,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:38:32,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:38:32,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:38:32,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:38:32,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:38:32,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:38:32,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:38:32,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:38:32,644 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:38:32,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:38:32,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:38:32,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:38:32,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:38:32,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:38:32,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:38:32,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:38:32,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:38:32,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:38:32,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:38:32,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:38:32,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:38:32,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:38:32,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:38:32,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:38:32,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:38:32,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:38:32,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:38:32,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:38:32,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:38:32,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:38:32,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:38:32,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:38:32,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:38:32,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:38:32,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:38:32,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:38:32,655 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 -> be2e40f79fa9aafe544dbfb6b1d1f051df435db5ea0b560bd0fc960acf5ae062 [2024-11-08 22:38:32,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:38:32,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:38:32,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:38:32,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:38:32,886 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:38:32,887 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-53.i [2024-11-08 22:38:34,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:38:34,327 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:38:34,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-53.i [2024-11-08 22:38:34,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae81bf20f/6e3cc144390245fbba947f8e425a7f44/FLAG13fd33792 [2024-11-08 22:38:34,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae81bf20f/6e3cc144390245fbba947f8e425a7f44 [2024-11-08 22:38:34,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:38:34,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:38:34,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:38:34,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:38:34,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:38:34,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a469f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34, skipping insertion in model container [2024-11-08 22:38:34,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:38:34,512 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-53.i[919,932] [2024-11-08 22:38:34,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:38:34,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:38:34,593 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-53.i[919,932] [2024-11-08 22:38:34,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:38:34,710 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:38:34,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34 WrapperNode [2024-11-08 22:38:34,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:38:34,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:38:34,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:38:34,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:38:34,720 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:38:34" (1/1) ... [2024-11-08 22:38:34,729 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:38:34" (1/1) ... [2024-11-08 22:38:34,762 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-11-08 22:38:34,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:38:34,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:38:34,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:38:34,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:38:34,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,787 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:38:34,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:38:34,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:38:34,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:38:34,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:38:34,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (1/1) ... [2024-11-08 22:38:34,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:38:34,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:38:34,845 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:38:34,854 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:38:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:38:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:38:34,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:38:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:38:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:38:34,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:38:34,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:38:34,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:38:35,287 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-08 22:38:35,288 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:38:35,297 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:38:35,298 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:38:35,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:38:35 BoogieIcfgContainer [2024-11-08 22:38:35,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:38:35,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:38:35,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:38:35,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:38:35,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:38:34" (1/3) ... [2024-11-08 22:38:35,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7468ad9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:38:35, skipping insertion in model container [2024-11-08 22:38:35,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:34" (2/3) ... [2024-11-08 22:38:35,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7468ad9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:38:35, skipping insertion in model container [2024-11-08 22:38:35,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:38:35" (3/3) ... [2024-11-08 22:38:35,304 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-53.i [2024-11-08 22:38:35,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:38:35,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:38:35,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:38:35,364 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;@24fca0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:38:35,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:38:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:38:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 22:38:35,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:35,393 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:35,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:35,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -831156585, now seen corresponding path program 1 times [2024-11-08 22:38:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393907776] [2024-11-08 22:38:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393907776] [2024-11-08 22:38:35,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393907776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:35,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:35,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:38:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981924078] [2024-11-08 22:38:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:38:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:38:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:38:35,891 INFO L87 Difference]: Start difference. First operand has 112 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:38:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:35,915 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2024-11-08 22:38:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:38:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205 [2024-11-08 22:38:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:35,923 INFO L225 Difference]: With dead ends: 217 [2024-11-08 22:38:35,923 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 22:38:35,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:38:35,928 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:38:35,929 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:38:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 22:38:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 22:38:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:38:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2024-11-08 22:38:35,965 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 205 [2024-11-08 22:38:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:35,966 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2024-11-08 22:38:35,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:38:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2024-11-08 22:38:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 22:38:35,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:35,970 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:35,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:38:35,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:35,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2054637093, now seen corresponding path program 1 times [2024-11-08 22:38:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594914174] [2024-11-08 22:38:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594914174] [2024-11-08 22:38:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594914174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:38:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590129368] [2024-11-08 22:38:36,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:36,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:36,414 INFO L87 Difference]: Start difference. First operand 108 states and 168 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:36,511 INFO L93 Difference]: Finished difference Result 291 states and 459 transitions. [2024-11-08 22:38:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:36,512 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-08 22:38:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:36,514 INFO L225 Difference]: With dead ends: 291 [2024-11-08 22:38:36,514 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 22:38:36,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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:38:36,519 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 73 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:36,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 303 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:38:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 22:38:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2024-11-08 22:38:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 22:38:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 259 transitions. [2024-11-08 22:38:36,566 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 259 transitions. Word has length 205 [2024-11-08 22:38:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 259 transitions. [2024-11-08 22:38:36,567 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 259 transitions. [2024-11-08 22:38:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 22:38:36,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:36,570 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:38:36,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash -287471043, now seen corresponding path program 1 times [2024-11-08 22:38:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509452100] [2024-11-08 22:38:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509452100] [2024-11-08 22:38:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509452100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:36,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:36,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:38:36,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324745872] [2024-11-08 22:38:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:36,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:36,723 INFO L87 Difference]: Start difference. First operand 166 states and 259 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:36,791 INFO L93 Difference]: Finished difference Result 366 states and 571 transitions. [2024-11-08 22:38:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:36,792 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2024-11-08 22:38:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:36,795 INFO L225 Difference]: With dead ends: 366 [2024-11-08 22:38:36,798 INFO L226 Difference]: Without dead ends: 258 [2024-11-08 22:38:36,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:38:36,800 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 149 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:36,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 300 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:38:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-08 22:38:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-11-08 22:38:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 159 states have internal predecessors, (208), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 394 transitions. [2024-11-08 22:38:36,844 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 394 transitions. Word has length 206 [2024-11-08 22:38:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:36,844 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 394 transitions. [2024-11-08 22:38:36,845 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 394 transitions. [2024-11-08 22:38:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 22:38:36,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:36,849 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:38:36,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash 11067422, now seen corresponding path program 1 times [2024-11-08 22:38:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303864726] [2024-11-08 22:38:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303864726] [2024-11-08 22:38:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303864726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:38:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412538632] [2024-11-08 22:38:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:36,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:36,994 INFO L87 Difference]: Start difference. First operand 256 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:37,055 INFO L93 Difference]: Finished difference Result 463 states and 712 transitions. [2024-11-08 22:38:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:37,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2024-11-08 22:38:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:37,058 INFO L225 Difference]: With dead ends: 463 [2024-11-08 22:38:37,058 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 22:38:37,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:38:37,061 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 142 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:37,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 436 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:38:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 22:38:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-11-08 22:38:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 167 states have (on average 1.281437125748503) internal successors, (214), 167 states have internal predecessors, (214), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 400 transitions. [2024-11-08 22:38:37,081 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 400 transitions. Word has length 207 [2024-11-08 22:38:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:37,081 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 400 transitions. [2024-11-08 22:38:37,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 400 transitions. [2024-11-08 22:38:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 22:38:37,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:37,083 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:38:37,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash 651748233, now seen corresponding path program 1 times [2024-11-08 22:38:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892429566] [2024-11-08 22:38:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:37,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892429566] [2024-11-08 22:38:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892429566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:38:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135623741] [2024-11-08 22:38:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:37,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:37,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:37,234 INFO L87 Difference]: Start difference. First operand 264 states and 400 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:37,345 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2024-11-08 22:38:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2024-11-08 22:38:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:37,351 INFO L225 Difference]: With dead ends: 582 [2024-11-08 22:38:37,351 INFO L226 Difference]: Without dead ends: 377 [2024-11-08 22:38:37,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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:38:37,355 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 152 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:37,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 435 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:38:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-08 22:38:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 266. [2024-11-08 22:38:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 169 states have internal predecessors, (216), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 402 transitions. [2024-11-08 22:38:37,416 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 402 transitions. Word has length 208 [2024-11-08 22:38:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:37,416 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 402 transitions. [2024-11-08 22:38:37,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 402 transitions. [2024-11-08 22:38:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 22:38:37,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:37,419 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:38:37,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1352812811, now seen corresponding path program 1 times [2024-11-08 22:38:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095177550] [2024-11-08 22:38:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095177550] [2024-11-08 22:38:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095177550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:38:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010405731] [2024-11-08 22:38:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:38:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:38:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:38:37,662 INFO L87 Difference]: Start difference. First operand 266 states and 402 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:37,863 INFO L93 Difference]: Finished difference Result 739 states and 1106 transitions. [2024-11-08 22:38:37,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:38:37,863 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2024-11-08 22:38:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:37,868 INFO L225 Difference]: With dead ends: 739 [2024-11-08 22:38:37,868 INFO L226 Difference]: Without dead ends: 532 [2024-11-08 22:38:37,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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:38:37,871 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 169 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:37,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 487 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:38:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-08 22:38:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 514. [2024-11-08 22:38:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 353 states have (on average 1.2974504249291785) internal successors, (458), 353 states have internal predecessors, (458), 155 states have call successors, (155), 5 states have call predecessors, (155), 5 states have return successors, (155), 155 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 22:38:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 768 transitions. [2024-11-08 22:38:37,929 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 768 transitions. Word has length 208 [2024-11-08 22:38:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 768 transitions. [2024-11-08 22:38:37,931 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 768 transitions. [2024-11-08 22:38:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:38:37,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:37,933 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:38:37,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 628825137, now seen corresponding path program 1 times [2024-11-08 22:38:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393585270] [2024-11-08 22:38:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:38,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393585270] [2024-11-08 22:38:38,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393585270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:38,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:38,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:38:38,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314598645] [2024-11-08 22:38:38,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:38,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:38,262 INFO L87 Difference]: Start difference. First operand 514 states and 768 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:38,339 INFO L93 Difference]: Finished difference Result 997 states and 1488 transitions. [2024-11-08 22:38:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:38,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2024-11-08 22:38:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:38,345 INFO L225 Difference]: With dead ends: 997 [2024-11-08 22:38:38,345 INFO L226 Difference]: Without dead ends: 542 [2024-11-08 22:38:38,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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:38:38,347 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 61 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 297 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:38,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 297 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:38:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-08 22:38:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 517. [2024-11-08 22:38:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 356 states have (on average 1.297752808988764) internal successors, (462), 356 states have internal predecessors, (462), 155 states have call successors, (155), 5 states have call predecessors, (155), 5 states have return successors, (155), 155 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 22:38:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 772 transitions. [2024-11-08 22:38:38,403 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 772 transitions. Word has length 209 [2024-11-08 22:38:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:38,404 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 772 transitions. [2024-11-08 22:38:38,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 772 transitions. [2024-11-08 22:38:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:38:38,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:38,406 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:38,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:38:38,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:38,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash 119352047, now seen corresponding path program 1 times [2024-11-08 22:38:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639186375] [2024-11-08 22:38:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:38,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:38:38,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:38,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639186375] [2024-11-08 22:38:38,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639186375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:38:38,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493301066] [2024-11-08 22:38:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:38:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:38:38,642 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:38:38,648 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:38:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:38,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 22:38:38,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-08 22:38:39,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:38:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:38:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493301066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:38:39,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:38:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 19 [2024-11-08 22:38:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566246102] [2024-11-08 22:38:39,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:38:39,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 22:38:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:39,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 22:38:39,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-08 22:38:39,825 INFO L87 Difference]: Start difference. First operand 517 states and 772 transitions. Second operand has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 19 states have internal predecessors, (144), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2024-11-08 22:38:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:42,601 INFO L93 Difference]: Finished difference Result 1353 states and 1951 transitions. [2024-11-08 22:38:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-08 22:38:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 19 states have internal predecessors, (144), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 209 [2024-11-08 22:38:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:42,606 INFO L225 Difference]: With dead ends: 1353 [2024-11-08 22:38:42,606 INFO L226 Difference]: Without dead ends: 898 [2024-11-08 22:38:42,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 468 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1174, Invalid=4526, Unknown=0, NotChecked=0, Total=5700 [2024-11-08 22:38:42,609 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1143 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 3723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:42,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 2987 Invalid, 3723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 22:38:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-08 22:38:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 551. [2024-11-08 22:38:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 380 states have (on average 1.25) internal successors, (475), 380 states have internal predecessors, (475), 155 states have call successors, (155), 15 states have call predecessors, (155), 15 states have return successors, (155), 155 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 22:38:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 785 transitions. [2024-11-08 22:38:42,653 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 785 transitions. Word has length 209 [2024-11-08 22:38:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 785 transitions. [2024-11-08 22:38:42,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 19 states have internal predecessors, (144), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2024-11-08 22:38:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 785 transitions. [2024-11-08 22:38:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 22:38:42,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:42,655 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:38:42,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:38:42,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash 869530830, now seen corresponding path program 1 times [2024-11-08 22:38:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:42,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078508784] [2024-11-08 22:38:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:38:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:38:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:38:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 22:38:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:38:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:38:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:38:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 22:38:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:38:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:38:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:38:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:38:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:38:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:38:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:38:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:38:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:38:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:38:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:38:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:38:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:38:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:38:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:38:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 22:38:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 22:38:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:38:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:38:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 22:38:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 22:38:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 22:38:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 22:38:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078508784] [2024-11-08 22:38:43,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078508784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:43,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:43,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:38:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355098021] [2024-11-08 22:38:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:43,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:38:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:43,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:38:43,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:38:43,090 INFO L87 Difference]: Start difference. First operand 551 states and 785 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:43,192 INFO L93 Difference]: Finished difference Result 791 states and 1126 transitions. [2024-11-08 22:38:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2024-11-08 22:38:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:43,194 INFO L225 Difference]: With dead ends: 791 [2024-11-08 22:38:43,195 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 22:38:43,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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:38:43,196 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:43,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 144 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:38:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 22:38:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-08 22:38:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 207 states have internal predecessors, (252), 93 states have call successors, (93), 9 states have call predecessors, (93), 9 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 438 transitions. [2024-11-08 22:38:43,223 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 438 transitions. Word has length 209 [2024-11-08 22:38:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:43,223 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 438 transitions. [2024-11-08 22:38:43,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 438 transitions. [2024-11-08 22:38:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 22:38:43,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:43,225 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:43,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 22:38:43,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash 768284701, now seen corresponding path program 1 times [2024-11-08 22:38:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754921387] [2024-11-08 22:38:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:38:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694268440] [2024-11-08 22:38:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:43,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:38:43,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:38:43,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:38:43,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 22:38:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:43,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:38:43,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 904 proven. 33 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-11-08 22:38:43,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:38:43,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:38:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754921387] [2024-11-08 22:38:43,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 22:38:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694268440] [2024-11-08 22:38:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694268440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:38:43,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:38:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-08 22:38:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883696062] [2024-11-08 22:38:43,849 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 22:38:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:38:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:38:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:38:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2024-11-08 22:38:43,850 INFO L87 Difference]: Start difference. First operand 310 states and 438 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:38:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:44,079 INFO L93 Difference]: Finished difference Result 581 states and 812 transitions. [2024-11-08 22:38:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:38:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 210 [2024-11-08 22:38:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:44,082 INFO L225 Difference]: With dead ends: 581 [2024-11-08 22:38:44,082 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 22:38:44,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=79, Unknown=1, NotChecked=0, Total=132 [2024-11-08 22:38:44,083 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 54 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:44,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 509 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:38:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 22:38:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 314. [2024-11-08 22:38:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 210 states have (on average 1.2095238095238094) internal successors, (254), 210 states have internal predecessors, (254), 93 states have call successors, (93), 10 states have call predecessors, (93), 10 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 440 transitions. [2024-11-08 22:38:44,110 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 440 transitions. Word has length 210 [2024-11-08 22:38:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:44,110 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 440 transitions. [2024-11-08 22:38:44,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:38:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 440 transitions. [2024-11-08 22:38:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 22:38:44,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:44,112 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:44,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 22:38:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 22:38:44,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:44,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1469884575, now seen corresponding path program 1 times [2024-11-08 22:38:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:38:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332018363] [2024-11-08 22:38:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:38:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:38:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342899689] [2024-11-08 22:38:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:44,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:38:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:38:44,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:38:44,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 22:38:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:38:44,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:38:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:38:44,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:38:44,731 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:38:44,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:38:44,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:38:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:38:44,937 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:38:45,034 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:38:45,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:38:45 BoogieIcfgContainer [2024-11-08 22:38:45,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:38:45,037 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:38:45,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:38:45,037 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:38:45,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:38:35" (3/4) ... [2024-11-08 22:38:45,040 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:38:45,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:38:45,041 INFO L158 Benchmark]: Toolchain (without parser) took 10692.25ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 89.6MB in the beginning and 164.3MB in the end (delta: -74.7MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2024-11-08 22:38:45,041 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:38:45,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.87ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 131.7MB in the end (delta: -42.3MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-08 22:38:45,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 127.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:38:45,041 INFO L158 Benchmark]: Boogie Preprocessor took 42.33ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 121.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:38:45,042 INFO L158 Benchmark]: RCFGBuilder took 492.63ms. Allocated memory is still 161.5MB. Free memory was 121.3MB in the beginning and 89.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 22:38:45,042 INFO L158 Benchmark]: TraceAbstraction took 9737.25ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 89.6MB in the beginning and 164.3MB in the end (delta: -74.6MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2024-11-08 22:38:45,042 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 343.9MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:38:45,043 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.10ms. Allocated memory is still 161.5MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.87ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 131.7MB in the end (delta: -42.3MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 127.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.33ms. Allocated memory is still 161.5MB. Free memory was 127.6MB in the beginning and 121.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 492.63ms. Allocated memory is still 161.5MB. Free memory was 121.3MB in the beginning and 89.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9737.25ms. Allocated memory was 161.5MB in the beginning and 343.9MB in the end (delta: 182.5MB). Free memory was 89.6MB in the beginning and 164.3MB in the end (delta: -74.6MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 343.9MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of shiftLeft at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 117, overapproximation of someUnaryFLOAToperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] unsigned short int var_1_31 = 8; [L41] unsigned char var_1_32 = 64; [L42] unsigned char var_1_33 = 1; [L43] unsigned char var_1_34 = 0; [L44] float var_1_35 = 32.4; [L45] float var_1_36 = 8.5; [L46] float var_1_37 = 7.5; [L47] float var_1_38 = 3.2; [L48] unsigned char var_1_39 = 16; [L49] unsigned char var_1_40 = 5; [L50] signed short int var_1_41 = -2; [L51] unsigned char var_1_42 = 10; [L52] unsigned char var_1_43 = 4; [L53] unsigned char var_1_44 = 64; [L54] signed long int var_1_45 = -25; [L55] unsigned char last_1_var_1_1 = 0; [L56] unsigned long int last_1_var_1_9 = 10; [L57] signed short int last_1_var_1_14 = 32; [L58] unsigned char last_1_var_1_16 = 1; [L59] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_9 = var_1_9 [L198] last_1_var_1_14 = var_1_14 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L149] var_1_11 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L151] var_1_12 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] var_1_13 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L155] var_1_15 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L166] var_1_19 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L170] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L172] var_1_32 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L173] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] CALL assume_abort_if_not(var_1_32 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] RET assume_abort_if_not(var_1_32 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L176] var_1_34 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_34 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] RET assume_abort_if_not(var_1_34 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] CALL assume_abort_if_not(var_1_34 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] RET assume_abort_if_not(var_1_34 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L179] var_1_36 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L181] var_1_37 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L183] var_1_38 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L184] RET assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L185] var_1_40 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L186] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] CALL assume_abort_if_not(var_1_43 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] RET assume_abort_if_not(var_1_43 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L191] var_1_44 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L192] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L211] RET updateVariables() [L212] CALL step() [L63] COND FALSE !(\read(var_1_1)) [L70] var_1_24 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L72] COND TRUE var_1_23 >= var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L73] COND FALSE !((4 % var_1_32) > var_1_23) [L76] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L79] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L80] COND FALSE !(var_1_16 >= var_1_23) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L83] COND FALSE !(var_1_1 || var_1_1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L86] COND TRUE \read(var_1_34) [L87] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L91] COND TRUE var_1_10 <= ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) [L92] var_1_42 = (((((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) < 0 ) ? -((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) : ((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L94] COND FALSE !((var_1_14 / var_1_32) >= var_1_23) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L99] COND TRUE ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) < (var_1_22 * var_1_10) [L100] var_1_45 = 4 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L103] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L104] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L105] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L110] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L111] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L111] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L112] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L114] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L115] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L116] COND TRUE (! var_1_1) || stepLocal_4 [L117] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L125] var_1_20 = var_1_21 [L126] var_1_22 = var_1_12 [L127] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L128] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L131] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L131] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L132] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L137] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L138] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L139] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L140] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L212] RET step() [L213] CALL, EXPR property() [L203] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L203] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L203-L204] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=9, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=-255, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=1, var_1_31=33, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=4, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 11, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2107 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2090 mSDsluCounter, 6066 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3968 mSDsCounter, 952 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3437 IncrementalHoareTripleChecker+Invalid, 4389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 952 mSolverCounterUnsat, 2098 mSDtfsCounter, 3437 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1408 GetRequests, 1311 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=8, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 550 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2915 NumberOfCodeBlocks, 2915 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2482 ConstructedInterpolants, 0 QuantifiedInterpolants, 5876 SizeOfPredicates, 7 NumberOfNonLiveVariables, 982 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 22167/22320 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:38:45,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-53.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 be2e40f79fa9aafe544dbfb6b1d1f051df435db5ea0b560bd0fc960acf5ae062 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:38:46,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:38:46,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:38:46,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:38:46,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:38:47,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:38:47,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:38:47,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:38:47,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:38:47,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:38:47,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:38:47,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:38:47,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:38:47,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:38:47,023 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:38:47,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:38:47,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:38:47,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:38:47,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:38:47,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:38:47,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:38:47,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:38:47,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:38:47,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:38:47,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:38:47,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:38:47,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:38:47,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:38:47,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:38:47,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:38:47,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:38:47,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:38:47,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:38:47,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:38:47,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:38:47,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:38:47,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:38:47,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:38:47,030 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:38:47,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:38:47,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:38:47,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:38:47,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:38:47,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:38:47,034 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 -> be2e40f79fa9aafe544dbfb6b1d1f051df435db5ea0b560bd0fc960acf5ae062 [2024-11-08 22:38:47,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:38:47,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:38:47,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:38:47,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:38:47,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:38:47,296 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-53.i [2024-11-08 22:38:48,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:38:48,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:38:48,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-53.i [2024-11-08 22:38:48,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7205b63/58c9592d82c04010a4fc27cad8ad33bc/FLAG56e9401d5 [2024-11-08 22:38:49,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7205b63/58c9592d82c04010a4fc27cad8ad33bc [2024-11-08 22:38:49,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:38:49,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:38:49,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:38:49,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:38:49,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:38:49,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65dace2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49, skipping insertion in model container [2024-11-08 22:38:49,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:38:49,410 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-53.i[919,932] [2024-11-08 22:38:49,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:38:49,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:38:49,504 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-53.i[919,932] [2024-11-08 22:38:49,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:38:49,561 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:38:49,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49 WrapperNode [2024-11-08 22:38:49,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:38:49,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:38:49,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:38:49,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:38:49,568 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:38:49" (1/1) ... [2024-11-08 22:38:49,580 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:38:49" (1/1) ... [2024-11-08 22:38:49,613 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-08 22:38:49,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:38:49,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:38:49,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:38:49,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:38:49,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,650 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:38:49,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:38:49,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:38:49,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:38:49,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:38:49,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (1/1) ... [2024-11-08 22:38:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:38:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:38:49,715 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:38:49,717 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:38:49,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:38:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:38:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:38:49,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:38:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:38:49,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:38:49,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:38:49,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:38:50,927 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 22:38:50,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:38:50,937 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:38:50,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:38:50,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:38:50 BoogieIcfgContainer [2024-11-08 22:38:50,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:38:50,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:38:50,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:38:50,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:38:50,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:38:49" (1/3) ... [2024-11-08 22:38:50,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dafbbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:38:50, skipping insertion in model container [2024-11-08 22:38:50,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:38:49" (2/3) ... [2024-11-08 22:38:50,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dafbbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:38:50, skipping insertion in model container [2024-11-08 22:38:50,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:38:50" (3/3) ... [2024-11-08 22:38:50,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-53.i [2024-11-08 22:38:50,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:38:50,957 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:38:51,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:38:51,008 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;@20c7b2f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:38:51,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:38:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:38:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 22:38:51,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:51,027 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:51,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash -947093788, now seen corresponding path program 1 times [2024-11-08 22:38:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376972335] [2024-11-08 22:38:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:51,044 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:38:51,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:51,046 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:38:51,047 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:38:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:51,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:38:51,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2024-11-08 22:38:51,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:38:51,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:38:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376972335] [2024-11-08 22:38:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376972335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:51,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:38:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279884475] [2024-11-08 22:38:51,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:51,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:38:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:38:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:38:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:38:51,554 INFO L87 Difference]: Start difference. First operand has 94 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:38:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:51,581 INFO L93 Difference]: Finished difference Result 181 states and 321 transitions. [2024-11-08 22:38:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:38:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 200 [2024-11-08 22:38:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:51,588 INFO L225 Difference]: With dead ends: 181 [2024-11-08 22:38:51,588 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 22:38:51,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 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:38:51,593 INFO L432 NwaCegarLoop]: 141 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, 141 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:38:51,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:38:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 22:38:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 22:38:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 22:38:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-08 22:38:51,625 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 200 [2024-11-08 22:38:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:51,625 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-08 22:38:51,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 22:38:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-08 22:38:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 22:38:51,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:51,629 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:38:51,832 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:38:51,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1375585942, now seen corresponding path program 1 times [2024-11-08 22:38:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930224961] [2024-11-08 22:38:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:51,835 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:38:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:51,838 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:38:51,839 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:38:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:52,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:38:52,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:52,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:38:52,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:38:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930224961] [2024-11-08 22:38:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930224961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:38:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874928172] [2024-11-08 22:38:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:38:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:52,978 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:53,635 INFO L93 Difference]: Finished difference Result 253 states and 402 transitions. [2024-11-08 22:38:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:53,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-08 22:38:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:53,640 INFO L225 Difference]: With dead ends: 253 [2024-11-08 22:38:53,640 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 22:38:53,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 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:38:53,641 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:53,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 253 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 22:38:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 22:38:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2024-11-08 22:38:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 22:38:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 233 transitions. [2024-11-08 22:38:53,673 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 233 transitions. Word has length 200 [2024-11-08 22:38:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:53,674 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 233 transitions. [2024-11-08 22:38:53,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 233 transitions. [2024-11-08 22:38:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 22:38:53,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:53,676 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:53,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 22:38:53,880 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:38:53,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1021050758, now seen corresponding path program 1 times [2024-11-08 22:38:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848608508] [2024-11-08 22:38:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:53,886 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:38:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:53,888 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:38:53,889 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:38:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:54,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:38:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:54,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:38:54,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:38:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848608508] [2024-11-08 22:38:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848608508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:54,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:54,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:38:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77119199] [2024-11-08 22:38:54,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:54,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:38:54,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:54,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:54,888 INFO L87 Difference]: Start difference. First operand 149 states and 233 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:55,290 INFO L93 Difference]: Finished difference Result 253 states and 400 transitions. [2024-11-08 22:38:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-08 22:38:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:55,293 INFO L225 Difference]: With dead ends: 253 [2024-11-08 22:38:55,293 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 22:38:55,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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:38:55,295 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 30 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:55,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 257 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:38:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 22:38:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2024-11-08 22:38:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 22:38:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2024-11-08 22:38:55,310 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 201 [2024-11-08 22:38:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:55,310 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2024-11-08 22:38:55,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2024-11-08 22:38:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 22:38:55,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:55,313 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:55,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 22:38:55,516 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:38:55,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 203402308, now seen corresponding path program 1 times [2024-11-08 22:38:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339583013] [2024-11-08 22:38:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:55,518 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:38:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:55,523 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:38:55,525 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:38:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:55,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:38:55,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:56,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:38:56,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:38:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339583013] [2024-11-08 22:38:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339583013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:38:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333353629] [2024-11-08 22:38:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:38:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:56,499 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:56,881 INFO L93 Difference]: Finished difference Result 325 states and 507 transitions. [2024-11-08 22:38:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-08 22:38:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:56,884 INFO L225 Difference]: With dead ends: 325 [2024-11-08 22:38:56,884 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 22:38:56,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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:38:56,885 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 38 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:56,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 254 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:38:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 22:38:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-08 22:38:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 133 states have internal predecessors, (169), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2024-11-08 22:38:56,922 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 201 [2024-11-08 22:38:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:56,922 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2024-11-08 22:38:56,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2024-11-08 22:38:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:38:56,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:56,924 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,937 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:38:57,128 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:38:57,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 811631719, now seen corresponding path program 1 times [2024-11-08 22:38:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911151341] [2024-11-08 22:38:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:57,131 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:38:57,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:57,133 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:38:57,134 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:38:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:57,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:38:57,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 870 proven. 30 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-08 22:38:57,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:38:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:38:57,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:38:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911151341] [2024-11-08 22:38:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911151341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:38:57,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:38:57,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 22:38:57,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395405944] [2024-11-08 22:38:57,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:38:57,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:38:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:38:57,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:38:57,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:38:57,732 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 22:38:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:58,129 INFO L93 Difference]: Finished difference Result 418 states and 635 transitions. [2024-11-08 22:38:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 22:38:58,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 202 [2024-11-08 22:38:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:58,133 INFO L225 Difference]: With dead ends: 418 [2024-11-08 22:38:58,133 INFO L226 Difference]: Without dead ends: 250 [2024-11-08 22:38:58,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:38:58,134 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 136 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:58,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 309 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:38:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-08 22:38:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2024-11-08 22:38:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 142 states have (on average 1.2253521126760563) internal successors, (174), 142 states have internal predecessors, (174), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 360 transitions. [2024-11-08 22:38:58,166 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 360 transitions. Word has length 202 [2024-11-08 22:38:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:58,167 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 360 transitions. [2024-11-08 22:38:58,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-08 22:38:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 360 transitions. [2024-11-08 22:38:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:38:58,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:58,169 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,183 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:38:58,369 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:38:58,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:58,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1794391835, now seen corresponding path program 1 times [2024-11-08 22:38:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870370172] [2024-11-08 22:38:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:58,371 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:38:58,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:58,374 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:38:58,375 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:38:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:58,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:38:58,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:38:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:38:58,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:38:58,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:38:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870370172] [2024-11-08 22:38:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870370172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:38:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:38:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:38:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25315271] [2024-11-08 22:38:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:38:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:38:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:38:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:38:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:58,708 INFO L87 Difference]: Start difference. First operand 242 states and 360 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:38:59,337 INFO L93 Difference]: Finished difference Result 513 states and 765 transitions. [2024-11-08 22:38:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:38:59,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-08 22:38:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:38:59,340 INFO L225 Difference]: With dead ends: 513 [2024-11-08 22:38:59,340 INFO L226 Difference]: Without dead ends: 337 [2024-11-08 22:38:59,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:38:59,350 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 124 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:38:59,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 371 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 22:38:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-08 22:38:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 244. [2024-11-08 22:38:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 144 states have (on average 1.2222222222222223) internal successors, (176), 144 states have internal predecessors, (176), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:38:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2024-11-08 22:38:59,390 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 202 [2024-11-08 22:38:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:38:59,393 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2024-11-08 22:38:59,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:38:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2024-11-08 22:38:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:38:59,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:38:59,396 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:59,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 22:38:59,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:38:59,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:38:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:38:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -19384473, now seen corresponding path program 1 times [2024-11-08 22:38:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:38:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147993901] [2024-11-08 22:38:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:38:59,599 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:38:59,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:38:59,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:38:59,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 22:38:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:38:59,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:38:59,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:39:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-08 22:39:00,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:39:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 22:39:00,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:39:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147993901] [2024-11-08 22:39:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147993901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:39:00,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:39:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-08 22:39:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832176047] [2024-11-08 22:39:00,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:39:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 22:39:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:39:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 22:39:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 22:39:00,428 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 22:39:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:39:02,286 INFO L93 Difference]: Finished difference Result 561 states and 817 transitions. [2024-11-08 22:39:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 22:39:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 202 [2024-11-08 22:39:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:39:02,290 INFO L225 Difference]: With dead ends: 561 [2024-11-08 22:39:02,290 INFO L226 Difference]: Without dead ends: 383 [2024-11-08 22:39:02,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2024-11-08 22:39:02,291 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 388 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:39:02,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 862 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 22:39:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-08 22:39:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 254. [2024-11-08 22:39:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 151 states have (on average 1.205298013245033) internal successors, (182), 151 states have internal predecessors, (182), 93 states have call successors, (93), 9 states have call predecessors, (93), 9 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:39:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 368 transitions. [2024-11-08 22:39:02,313 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 368 transitions. Word has length 202 [2024-11-08 22:39:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:39:02,313 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 368 transitions. [2024-11-08 22:39:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 22:39:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 368 transitions. [2024-11-08 22:39:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 22:39:02,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:39:02,315 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,329 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 (8)] Ended with exit code 0 [2024-11-08 22:39:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:39:02,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:39:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:39:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1924614207, now seen corresponding path program 1 times [2024-11-08 22:39:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:39:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384826601] [2024-11-08 22:39:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:39:02,520 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:39:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:39:02,523 INFO L229 MonitoredProcess]: Starting monitored process 9 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:39:02,524 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 (9)] Waiting until timeout for monitored process [2024-11-08 22:39:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:39:02,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:39:02,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:39:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 22:39:03,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:39:03,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:39:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384826601] [2024-11-08 22:39:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384826601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:39:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:39:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:39:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863629475] [2024-11-08 22:39:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:39:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:39:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:39:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:39:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:39:03,636 INFO L87 Difference]: Start difference. First operand 254 states and 368 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:39:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:39:04,438 INFO L93 Difference]: Finished difference Result 463 states and 670 transitions. [2024-11-08 22:39:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:39:04,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-08 22:39:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:39:04,440 INFO L225 Difference]: With dead ends: 463 [2024-11-08 22:39:04,441 INFO L226 Difference]: Without dead ends: 279 [2024-11-08 22:39:04,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:39:04,442 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 22:39:04,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 446 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 22:39:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-08 22:39:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2024-11-08 22:39:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 159 states have (on average 1.2138364779874213) internal successors, (193), 159 states have internal predecessors, (193), 93 states have call successors, (93), 9 states have call predecessors, (93), 9 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 22:39:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 379 transitions. [2024-11-08 22:39:04,461 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 379 transitions. Word has length 202 [2024-11-08 22:39:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:39:04,462 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 379 transitions. [2024-11-08 22:39:04,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 22:39:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 379 transitions. [2024-11-08 22:39:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 22:39:04,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:39:04,463 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,478 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 (9)] Ended with exit code 0 [2024-11-08 22:39:04,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:39:04,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:39:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:39:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -27132218, now seen corresponding path program 1 times [2024-11-08 22:39:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:39:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032739725] [2024-11-08 22:39:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:39:04,669 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:39:04,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:39:04,672 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:39:04,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 22:39:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:39:05,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 22:39:05,032 INFO L278 TraceCheckSpWp]: Computing forward predicates...