./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-76.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 37a401d94248af81d62b67901dd8ce902b105c572e909a68983c85bb0f29e843 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:43:35,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:43:35,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 21:43:35,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:43:35,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:43:35,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:43:35,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:43:35,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:43:35,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:43:35,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:43:35,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:43:35,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:43:35,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:43:35,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:43:35,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:43:35,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:43:35,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:43:35,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:43:35,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 21:43:35,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:43:35,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:43:35,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:43:35,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:43:35,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:43:35,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:43:35,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:43:35,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:43:35,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:43:35,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:43:35,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:43:35,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:43:35,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:43:35,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:43:35,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:43:35,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:43:35,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:43:35,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 21:43:35,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 21:43:35,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:43:35,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:43:35,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:43:35,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:43:35,321 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 -> 37a401d94248af81d62b67901dd8ce902b105c572e909a68983c85bb0f29e843 [2024-11-18 21:43:35,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:43:35,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:43:35,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:43:35,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:43:35,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:43:35,647 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-76.i [2024-11-18 21:43:37,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:43:37,323 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:43:37,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-76.i [2024-11-18 21:43:37,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b303d371a/6d04a69af0e34c558c0ad1a059cc61e3/FLAG029a3ab8c [2024-11-18 21:43:37,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b303d371a/6d04a69af0e34c558c0ad1a059cc61e3 [2024-11-18 21:43:37,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:43:37,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:43:37,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:43:37,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:43:37,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:43:37,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:43:37" (1/1) ... [2024-11-18 21:43:37,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf43fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:37, skipping insertion in model container [2024-11-18 21:43:37,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:43:37" (1/1) ... [2024-11-18 21:43:37,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:43:37,900 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-76.i[919,932] [2024-11-18 21:43:37,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:43:37,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:43:37,986 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-76.i[919,932] [2024-11-18 21:43:38,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:43:38,060 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:43:38,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38 WrapperNode [2024-11-18 21:43:38,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:43:38,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:43:38,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:43:38,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:43:38,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,117 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-11-18 21:43:38,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:43:38,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:43:38,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:43:38,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:43:38,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,159 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-18 21:43:38,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:43:38,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:43:38,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:43:38,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:43:38,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (1/1) ... [2024-11-18 21:43:38,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:43:38,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:38,238 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-18 21:43:38,244 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-18 21:43:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:43:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:43:38,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:43:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 21:43:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:43:38,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:43:38,370 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:43:38,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:43:38,787 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-18 21:43:38,787 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:43:38,806 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:43:38,806 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:43:38,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:43:38 BoogieIcfgContainer [2024-11-18 21:43:38,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:43:38,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:43:38,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:43:38,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:43:38,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:43:37" (1/3) ... [2024-11-18 21:43:38,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d017b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:43:38, skipping insertion in model container [2024-11-18 21:43:38,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:43:38" (2/3) ... [2024-11-18 21:43:38,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d017b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:43:38, skipping insertion in model container [2024-11-18 21:43:38,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:43:38" (3/3) ... [2024-11-18 21:43:38,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-76.i [2024-11-18 21:43:38,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:43:38,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:43:38,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:43:38,967 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;@169c7e7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:43:38,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:43:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 71 states have internal predecessors, (106), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-18 21:43:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-18 21:43:38,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:38,985 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:38,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:38,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -761926276, now seen corresponding path program 1 times [2024-11-18 21:43:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499542809] [2024-11-18 21:43:38,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-18 21:43:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499542809] [2024-11-18 21:43:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499542809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:43:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970432408] [2024-11-18 21:43:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:39,332 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-18 21:43:39,333 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-18 21:43:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:39,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:43:39,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:43:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-18 21:43:39,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:43:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970432408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:39,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 21:43:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 21:43:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097754480] [2024-11-18 21:43:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:43:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:43:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:43:39,604 INFO L87 Difference]: Start difference. First operand has 95 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 71 states have internal predecessors, (106), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 21:43:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:39,632 INFO L93 Difference]: Finished difference Result 178 states and 308 transitions. [2024-11-18 21:43:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:43:39,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2024-11-18 21:43:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:39,641 INFO L225 Difference]: With dead ends: 178 [2024-11-18 21:43:39,641 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 21:43:39,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-18 21:43:39,647 INFO L432 NwaCegarLoop]: 132 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, 132 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-18 21:43:39,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:43:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 21:43:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-18 21:43:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-18 21:43:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-18 21:43:39,691 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 154 [2024-11-18 21:43:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:39,691 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-18 21:43:39,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 21:43:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-18 21:43:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-18 21:43:39,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:39,695 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:39,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 21:43:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 21:43:39,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:39,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2035193652, now seen corresponding path program 1 times [2024-11-18 21:43:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:39,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826800105] [2024-11-18 21:43:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826800105] [2024-11-18 21:43:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826800105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 21:43:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401117002] [2024-11-18 21:43:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:40,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 21:43:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 21:43:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 21:43:40,418 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:40,584 INFO L93 Difference]: Finished difference Result 252 states and 390 transitions. [2024-11-18 21:43:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 21:43:40,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-18 21:43:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:40,588 INFO L225 Difference]: With dead ends: 252 [2024-11-18 21:43:40,590 INFO L226 Difference]: Without dead ends: 169 [2024-11-18 21:43:40,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 21:43:40,593 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 76 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:40,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 328 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:43:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-18 21:43:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-11-18 21:43:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 120 states have (on average 1.425) internal successors, (171), 120 states have internal predecessors, (171), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-18 21:43:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 259 transitions. [2024-11-18 21:43:40,635 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 259 transitions. Word has length 154 [2024-11-18 21:43:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 259 transitions. [2024-11-18 21:43:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 259 transitions. [2024-11-18 21:43:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-18 21:43:40,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:40,641 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:40,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 21:43:40,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1558709066, now seen corresponding path program 1 times [2024-11-18 21:43:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007176333] [2024-11-18 21:43:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007176333] [2024-11-18 21:43:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007176333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:43:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899371179] [2024-11-18 21:43:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:43:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:43:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:43:40,905 INFO L87 Difference]: Start difference. First operand 167 states and 259 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:41,042 INFO L93 Difference]: Finished difference Result 407 states and 637 transitions. [2024-11-18 21:43:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:43:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-18 21:43:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:41,047 INFO L225 Difference]: With dead ends: 407 [2024-11-18 21:43:41,049 INFO L226 Difference]: Without dead ends: 243 [2024-11-18 21:43:41,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 21:43:41,051 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 70 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:41,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 208 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:43:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-18 21:43:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 212. [2024-11-18 21:43:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 21:43:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 327 transitions. [2024-11-18 21:43:41,124 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 327 transitions. Word has length 154 [2024-11-18 21:43:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:41,125 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 327 transitions. [2024-11-18 21:43:41,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-18 21:43:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-18 21:43:41,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:41,133 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 21:43:41,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1692722572, now seen corresponding path program 1 times [2024-11-18 21:43:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977631478] [2024-11-18 21:43:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977631478] [2024-11-18 21:43:41,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977631478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:41,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 21:43:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298515966] [2024-11-18 21:43:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 21:43:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 21:43:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 21:43:41,366 INFO L87 Difference]: Start difference. First operand 212 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:41,886 INFO L93 Difference]: Finished difference Result 844 states and 1311 transitions. [2024-11-18 21:43:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 21:43:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-18 21:43:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:41,892 INFO L225 Difference]: With dead ends: 844 [2024-11-18 21:43:41,892 INFO L226 Difference]: Without dead ends: 680 [2024-11-18 21:43:41,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 21:43:41,894 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 346 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:41,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 469 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 21:43:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-18 21:43:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 670. [2024-11-18 21:43:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 462 states have (on average 1.3636363636363635) internal successors, (630), 462 states have internal predecessors, (630), 198 states have call successors, (198), 9 states have call predecessors, (198), 9 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-11-18 21:43:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1026 transitions. [2024-11-18 21:43:41,985 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1026 transitions. Word has length 154 [2024-11-18 21:43:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:41,985 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1026 transitions. [2024-11-18 21:43:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1026 transitions. [2024-11-18 21:43:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-18 21:43:41,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:41,988 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 21:43:41,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:41,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 301422134, now seen corresponding path program 1 times [2024-11-18 21:43:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846775638] [2024-11-18 21:43:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846775638] [2024-11-18 21:43:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846775638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 21:43:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224638433] [2024-11-18 21:43:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 21:43:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:42,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 21:43:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 21:43:42,229 INFO L87 Difference]: Start difference. First operand 670 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:42,416 INFO L93 Difference]: Finished difference Result 1302 states and 2001 transitions. [2024-11-18 21:43:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:43:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-18 21:43:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:42,423 INFO L225 Difference]: With dead ends: 1302 [2024-11-18 21:43:42,423 INFO L226 Difference]: Without dead ends: 680 [2024-11-18 21:43:42,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 21:43:42,426 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 187 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:42,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 215 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:43:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-18 21:43:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2024-11-18 21:43:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 470 states have (on average 1.372340425531915) internal successors, (645), 470 states have internal predecessors, (645), 198 states have call successors, (198), 9 states have call predecessors, (198), 9 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-11-18 21:43:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1041 transitions. [2024-11-18 21:43:42,504 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1041 transitions. Word has length 154 [2024-11-18 21:43:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:42,505 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1041 transitions. [2024-11-18 21:43:42,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1041 transitions. [2024-11-18 21:43:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 21:43:42,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:42,508 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:42,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 21:43:42,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:42,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:42,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1557499951, now seen corresponding path program 1 times [2024-11-18 21:43:42,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984572148] [2024-11-18 21:43:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:42,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984572148] [2024-11-18 21:43:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984572148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:43:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886706068] [2024-11-18 21:43:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:43:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:42,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:43:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:43:42,804 INFO L87 Difference]: Start difference. First operand 678 states and 1041 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:42,962 INFO L93 Difference]: Finished difference Result 1628 states and 2502 transitions. [2024-11-18 21:43:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:43:42,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-18 21:43:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:42,970 INFO L225 Difference]: With dead ends: 1628 [2024-11-18 21:43:42,970 INFO L226 Difference]: Without dead ends: 998 [2024-11-18 21:43:42,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-18 21:43:42,973 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 75 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:42,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 244 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:43:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-11-18 21:43:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 996. [2024-11-18 21:43:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 696 states have (on average 1.3721264367816093) internal successors, (955), 696 states have internal predecessors, (955), 286 states have call successors, (286), 13 states have call predecessors, (286), 13 states have return successors, (286), 286 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-18 21:43:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1527 transitions. [2024-11-18 21:43:43,066 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1527 transitions. Word has length 156 [2024-11-18 21:43:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:43,067 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1527 transitions. [2024-11-18 21:43:43,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1527 transitions. [2024-11-18 21:43:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 21:43:43,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:43,069 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 21:43:43,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1149119443, now seen corresponding path program 1 times [2024-11-18 21:43:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578912509] [2024-11-18 21:43:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:43:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347687750] [2024-11-18 21:43:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:43,169 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-18 21:43:43,171 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-18 21:43:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:43,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 21:43:43,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:43:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:44,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:43:44,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578912509] [2024-11-18 21:43:44,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 21:43:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347687750] [2024-11-18 21:43:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347687750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 21:43:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577770020] [2024-11-18 21:43:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:44,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 21:43:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 21:43:44,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-18 21:43:44,023 INFO L87 Difference]: Start difference. First operand 996 states and 1527 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:46,025 INFO L93 Difference]: Finished difference Result 3908 states and 5996 transitions. [2024-11-18 21:43:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 21:43:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-18 21:43:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:46,042 INFO L225 Difference]: With dead ends: 3908 [2024-11-18 21:43:46,042 INFO L226 Difference]: Without dead ends: 2860 [2024-11-18 21:43:46,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2024-11-18 21:43:46,047 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1016 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:46,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1526 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 21:43:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2024-11-18 21:43:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2255. [2024-11-18 21:43:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1541 states have (on average 1.3413367942894225) internal successors, (2067), 1541 states have internal predecessors, (2067), 682 states have call successors, (682), 31 states have call predecessors, (682), 31 states have return successors, (682), 682 states have call predecessors, (682), 682 states have call successors, (682) [2024-11-18 21:43:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3431 transitions. [2024-11-18 21:43:46,252 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3431 transitions. Word has length 156 [2024-11-18 21:43:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:46,253 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 3431 transitions. [2024-11-18 21:43:46,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3431 transitions. [2024-11-18 21:43:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 21:43:46,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:46,255 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:46,274 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-18 21:43:46,456 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,SelfDestructingSolverStorable6 [2024-11-18 21:43:46,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:46,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash 469061073, now seen corresponding path program 1 times [2024-11-18 21:43:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733951121] [2024-11-18 21:43:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:43:46,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887474226] [2024-11-18 21:43:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:46,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:46,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:46,516 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-18 21:43:46,517 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-18 21:43:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:46,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 21:43:46,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:43:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:48,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:43:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733951121] [2024-11-18 21:43:48,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 21:43:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887474226] [2024-11-18 21:43:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887474226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 21:43:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157121804] [2024-11-18 21:43:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 21:43:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 21:43:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-18 21:43:48,322 INFO L87 Difference]: Start difference. First operand 2255 states and 3431 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:49,412 INFO L93 Difference]: Finished difference Result 4255 states and 6458 transitions. [2024-11-18 21:43:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 21:43:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-18 21:43:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:49,436 INFO L225 Difference]: With dead ends: 4255 [2024-11-18 21:43:49,437 INFO L226 Difference]: Without dead ends: 3625 [2024-11-18 21:43:49,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-18 21:43:49,444 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 500 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:49,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1291 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 21:43:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2024-11-18 21:43:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3025. [2024-11-18 21:43:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2058 states have (on average 1.3294460641399417) internal successors, (2736), 2058 states have internal predecessors, (2736), 924 states have call successors, (924), 42 states have call predecessors, (924), 42 states have return successors, (924), 924 states have call predecessors, (924), 924 states have call successors, (924) [2024-11-18 21:43:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 4584 transitions. [2024-11-18 21:43:49,711 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 4584 transitions. Word has length 156 [2024-11-18 21:43:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:49,712 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 4584 transitions. [2024-11-18 21:43:49,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 4584 transitions. [2024-11-18 21:43:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 21:43:49,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:49,714 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:49,740 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-18 21:43:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:49,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:49,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -48022366, now seen corresponding path program 1 times [2024-11-18 21:43:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:49,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295819040] [2024-11-18 21:43:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:43:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553215907] [2024-11-18 21:43:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:49,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:49,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:49,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:43:49,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 21:43:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:50,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 21:43:50,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:43:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:50,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:43:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295819040] [2024-11-18 21:43:50,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 21:43:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553215907] [2024-11-18 21:43:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553215907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 21:43:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922637497] [2024-11-18 21:43:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:50,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 21:43:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 21:43:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 21:43:50,534 INFO L87 Difference]: Start difference. First operand 3025 states and 4584 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:50,948 INFO L93 Difference]: Finished difference Result 6890 states and 10514 transitions. [2024-11-18 21:43:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 21:43:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-18 21:43:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:50,974 INFO L225 Difference]: With dead ends: 6890 [2024-11-18 21:43:50,975 INFO L226 Difference]: Without dead ends: 4638 [2024-11-18 21:43:50,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-18 21:43:50,986 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 215 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:50,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1690 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:43:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2024-11-18 21:43:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 3557. [2024-11-18 21:43:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3557 states, 2383 states have (on average 1.312211498111624) internal successors, (3127), 2383 states have internal predecessors, (3127), 1122 states have call successors, (1122), 51 states have call predecessors, (1122), 51 states have return successors, (1122), 1122 states have call predecessors, (1122), 1122 states have call successors, (1122) [2024-11-18 21:43:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 5371 transitions. [2024-11-18 21:43:51,308 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 5371 transitions. Word has length 157 [2024-11-18 21:43:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:51,309 INFO L471 AbstractCegarLoop]: Abstraction has 3557 states and 5371 transitions. [2024-11-18 21:43:51,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5371 transitions. [2024-11-18 21:43:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 21:43:51,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:51,311 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:51,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 21:43:51,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:51,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:51,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash -728080736, now seen corresponding path program 1 times [2024-11-18 21:43:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825798695] [2024-11-18 21:43:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:43:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010870658] [2024-11-18 21:43:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:51,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:51,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:43:51,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 21:43:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:51,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 21:43:51,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:43:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:52,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:43:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825798695] [2024-11-18 21:43:52,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 21:43:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010870658] [2024-11-18 21:43:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010870658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 21:43:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913572469] [2024-11-18 21:43:52,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:52,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 21:43:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 21:43:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-18 21:43:52,957 INFO L87 Difference]: Start difference. First operand 3557 states and 5371 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:53,801 INFO L93 Difference]: Finished difference Result 4661 states and 7029 transitions. [2024-11-18 21:43:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 21:43:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-18 21:43:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:53,824 INFO L225 Difference]: With dead ends: 4661 [2024-11-18 21:43:53,825 INFO L226 Difference]: Without dead ends: 4031 [2024-11-18 21:43:53,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-18 21:43:53,829 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 348 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:53,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1177 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 21:43:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2024-11-18 21:43:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 3635. [2024-11-18 21:43:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3635 states, 2438 states have (on average 1.3125512715340444) internal successors, (3200), 2438 states have internal predecessors, (3200), 1144 states have call successors, (1144), 52 states have call predecessors, (1144), 52 states have return successors, (1144), 1144 states have call predecessors, (1144), 1144 states have call successors, (1144) [2024-11-18 21:43:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5488 transitions. [2024-11-18 21:43:54,178 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5488 transitions. Word has length 157 [2024-11-18 21:43:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 3635 states and 5488 transitions. [2024-11-18 21:43:54,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5488 transitions. [2024-11-18 21:43:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 21:43:54,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:54,181 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:54,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 21:43:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 21:43:54,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:54,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2065558361, now seen corresponding path program 1 times [2024-11-18 21:43:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100143905] [2024-11-18 21:43:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:43:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:43:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:43:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100143905] [2024-11-18 21:43:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100143905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:43:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:43:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:43:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756817563] [2024-11-18 21:43:54,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:43:54,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:43:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:43:54,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:43:54,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:43:54,452 INFO L87 Difference]: Start difference. First operand 3635 states and 5488 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:43:54,722 INFO L93 Difference]: Finished difference Result 8194 states and 12265 transitions. [2024-11-18 21:43:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:43:54,722 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-18 21:43:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:43:54,761 INFO L225 Difference]: With dead ends: 8194 [2024-11-18 21:43:54,762 INFO L226 Difference]: Without dead ends: 4622 [2024-11-18 21:43:54,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 21:43:54,773 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:43:54,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 246 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:43:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2024-11-18 21:43:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4094. [2024-11-18 21:43:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4094 states, 2897 states have (on average 1.3265447014152572) internal successors, (3843), 2897 states have internal predecessors, (3843), 1144 states have call successors, (1144), 52 states have call predecessors, (1144), 52 states have return successors, (1144), 1144 states have call predecessors, (1144), 1144 states have call successors, (1144) [2024-11-18 21:43:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 6131 transitions. [2024-11-18 21:43:55,172 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 6131 transitions. Word has length 157 [2024-11-18 21:43:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:43:55,175 INFO L471 AbstractCegarLoop]: Abstraction has 4094 states and 6131 transitions. [2024-11-18 21:43:55,175 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:43:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 6131 transitions. [2024-11-18 21:43:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 21:43:55,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:43:55,178 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:43:55,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 21:43:55,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:43:55,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:43:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash -454401573, now seen corresponding path program 1 times [2024-11-18 21:43:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:43:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976455865] [2024-11-18 21:43:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:43:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:43:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797379006] [2024-11-18 21:43:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:43:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:43:55,244 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:43:55,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 21:43:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 21:43:55,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 21:43:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 21:43:55,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 21:43:55,575 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 21:43:55,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 21:43:55,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 21:43:55,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:43:55,783 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:43:55,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 21:43:55,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:43:55 BoogieIcfgContainer [2024-11-18 21:43:55,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 21:43:55,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 21:43:55,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 21:43:55,916 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 21:43:55,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:43:38" (3/4) ... [2024-11-18 21:43:55,918 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 21:43:55,920 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 21:43:55,920 INFO L158 Benchmark]: Toolchain (without parser) took 18223.11ms. Allocated memory was 163.6MB in the beginning and 658.5MB in the end (delta: 494.9MB). Free memory was 132.0MB in the beginning and 498.2MB in the end (delta: -366.3MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-11-18 21:43:55,920 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 21:43:55,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.61ms. Allocated memory is still 163.6MB. Free memory was 130.9MB in the beginning and 114.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 21:43:55,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.66ms. Allocated memory is still 163.6MB. Free memory was 114.1MB in the beginning and 110.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 21:43:55,921 INFO L158 Benchmark]: Boogie Preprocessor took 85.27ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 104.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 21:43:55,921 INFO L158 Benchmark]: RCFGBuilder took 602.49ms. Allocated memory is still 163.6MB. Free memory was 104.7MB in the beginning and 76.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-18 21:43:55,922 INFO L158 Benchmark]: TraceAbstraction took 17106.24ms. Allocated memory was 163.6MB in the beginning and 658.5MB in the end (delta: 494.9MB). Free memory was 75.4MB in the beginning and 498.2MB in the end (delta: -422.9MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-11-18 21:43:55,922 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 658.5MB. Free memory is still 498.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 21:43:55,923 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.16ms. Allocated memory is still 109.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.61ms. Allocated memory is still 163.6MB. Free memory was 130.9MB in the beginning and 114.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.66ms. Allocated memory is still 163.6MB. Free memory was 114.1MB in the beginning and 110.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.27ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 104.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 602.49ms. Allocated memory is still 163.6MB. Free memory was 104.7MB in the beginning and 76.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17106.24ms. Allocated memory was 163.6MB in the beginning and 658.5MB in the end (delta: 494.9MB). Free memory was 75.4MB in the beginning and 498.2MB in the end (delta: -422.9MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 658.5MB. Free memory is still 498.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseAnd at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] double var_1_22 = 1.5; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed long int var_1_27 = 0; [L44] signed short int var_1_29 = 2; [L45] unsigned char var_1_31 = 1; [L46] signed long int var_1_32 = 32; [L47] signed long int var_1_34 = 0; [L48] unsigned char var_1_37 = 1; [L49] unsigned long int var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 0; [L52] double last_1_var_1_1 = 256.5; [L53] float last_1_var_1_8 = 5.25; [L54] signed long int last_1_var_1_11 = 4; [L55] unsigned short int last_1_var_1_14 = 10000; [L56] unsigned short int last_1_var_1_17 = 4; [L57] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L179] last_1_var_1_1 = var_1_1 [L180] last_1_var_1_8 = var_1_8 [L181] last_1_var_1_11 = var_1_11 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = var_1_17 [L184] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_3 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_4 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_5 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L151] var_1_7 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] var_1_16 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] var_1_19 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] var_1_20 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_22=3/2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L170] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L170] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L172] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L173] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L173] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L174] var_1_40 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L175] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L176] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L176] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L195] RET updateVariables() [L196] CALL step() [L61] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L62] COND FALSE !(var_1_22 < (- var_1_8)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L69] var_1_27 = var_1_17 [L70] var_1_29 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L71] COND FALSE !(var_1_11 == var_1_18) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L74] COND FALSE !(var_1_18 < ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L79] COND TRUE var_1_18 < var_1_14 [L80] var_1_34 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L90] var_1_37 = (var_1_23 && var_1_25) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L91] EXPR var_1_18 & var_1_14 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L91] EXPR (var_1_18 & var_1_14) & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L91] COND FALSE !(((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) <= ((var_1_18 & var_1_14) & var_1_18)) [L94] COND FALSE !(var_1_18 < var_1_17) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L97] COND FALSE !(\read(var_1_2)) [L106] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L108] COND TRUE ! var_1_2 [L109] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L113] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L118] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L119] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L119] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L122] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L129] COND FALSE !(var_1_4 <= last_1_var_1_1) [L132] var_1_11 = (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L134] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=-252, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L135] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L136] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L187-L188] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=-252, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=4, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2856 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2856 mSDsluCounter, 7526 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5250 mSDsCounter, 438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3643 IncrementalHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 438 mSolverCounterUnsat, 2276 mSDtfsCounter, 3643 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4094occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 3257 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2803 NumberOfCodeBlocks, 2803 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1851 ConstructedInterpolants, 0 QuantifiedInterpolants, 10727 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1924 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 11046/11088 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-18 21:43:55,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-76.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 37a401d94248af81d62b67901dd8ce902b105c572e909a68983c85bb0f29e843 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:43:58,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:43:58,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 21:43:58,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:43:58,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:43:58,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:43:58,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:43:58,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:43:58,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:43:58,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:43:58,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:43:58,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:43:58,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:43:58,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:43:58,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:43:58,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:43:58,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:43:58,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:43:58,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:43:58,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:43:58,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:43:58,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:43:58,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:43:58,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 21:43:58,406 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 21:43:58,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:43:58,406 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 21:43:58,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:43:58,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:43:58,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:43:58,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:43:58,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:43:58,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:43:58,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:43:58,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:43:58,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:43:58,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:43:58,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:43:58,410 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 21:43:58,410 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 21:43:58,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:43:58,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:43:58,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:43:58,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:43:58,412 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 -> 37a401d94248af81d62b67901dd8ce902b105c572e909a68983c85bb0f29e843 [2024-11-18 21:43:58,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:43:58,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:43:58,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:43:58,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:43:58,732 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:43:58,733 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-76.i [2024-11-18 21:44:00,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:44:00,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:44:00,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-76.i [2024-11-18 21:44:00,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4a4258c/340541d2c0cb4931b47a852fb392c22c/FLAG337be9e55 [2024-11-18 21:44:00,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4a4258c/340541d2c0cb4931b47a852fb392c22c [2024-11-18 21:44:00,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:44:00,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:44:00,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:44:00,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:44:00,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:44:00,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:00,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508ce957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00, skipping insertion in model container [2024-11-18 21:44:00,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:00,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:44:00,746 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-76.i[919,932] [2024-11-18 21:44:00,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:44:00,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:44:00,855 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-76.i[919,932] [2024-11-18 21:44:00,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:44:00,945 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:44:00,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00 WrapperNode [2024-11-18 21:44:00,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:44:00,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:44:00,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:44:00,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:44:00,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:00,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,010 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-18 21:44:01,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:44:01,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:44:01,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:44:01,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:44:01,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,054 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-18 21:44:01,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:44:01,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:44:01,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:44:01,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:44:01,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (1/1) ... [2024-11-18 21:44:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:44:01,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:44:01,138 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-18 21:44:01,144 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-18 21:44:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:44:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 21:44:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:44:01,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:44:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:44:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:44:01,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:44:01,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:44:14,630 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 21:44:14,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:44:14,645 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:44:14,646 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:44:14,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:44:14 BoogieIcfgContainer [2024-11-18 21:44:14,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:44:14,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:44:14,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:44:14,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:44:14,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:44:00" (1/3) ... [2024-11-18 21:44:14,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d021cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:44:14, skipping insertion in model container [2024-11-18 21:44:14,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:00" (2/3) ... [2024-11-18 21:44:14,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d021cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:44:14, skipping insertion in model container [2024-11-18 21:44:14,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:44:14" (3/3) ... [2024-11-18 21:44:14,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-76.i [2024-11-18 21:44:14,672 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:44:14,672 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:44:14,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:44:14,741 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;@3784450b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:44:14,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:44:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-18 21:44:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 21:44:14,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:44:14,761 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:44:14,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:44:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:44:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1993650988, now seen corresponding path program 1 times [2024-11-18 21:44:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:44:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174593981] [2024-11-18 21:44:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:44:14,784 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-18 21:44:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:44:14,786 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-18 21:44:14,787 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-18 21:44:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:44:15,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:44:15,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:44:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-18 21:44:15,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:44:15,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:44:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174593981] [2024-11-18 21:44:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174593981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:44:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:44:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 21:44:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11892125] [2024-11-18 21:44:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:44:15,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:44:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:44:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:44:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:44:15,682 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 21:44:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:44:15,721 INFO L93 Difference]: Finished difference Result 152 states and 266 transitions. [2024-11-18 21:44:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:44:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2024-11-18 21:44:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:44:15,733 INFO L225 Difference]: With dead ends: 152 [2024-11-18 21:44:15,734 INFO L226 Difference]: Without dead ends: 75 [2024-11-18 21:44:15,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-18 21:44:15,742 INFO L432 NwaCegarLoop]: 116 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, 116 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-18 21:44:15,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:44:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-18 21:44:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-18 21:44:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-18 21:44:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2024-11-18 21:44:15,794 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 149 [2024-11-18 21:44:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:44:15,794 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2024-11-18 21:44:15,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-18 21:44:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2024-11-18 21:44:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 21:44:15,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:44:15,799 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:44:15,823 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-18 21:44:16,000 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-18 21:44:16,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:44:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:44:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 366401140, now seen corresponding path program 1 times [2024-11-18 21:44:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:44:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913134503] [2024-11-18 21:44:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:44:16,003 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-18 21:44:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:44:16,005 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-18 21:44:16,006 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-18 21:44:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:44:16,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 21:44:16,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:44:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:44:23,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:44:23,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:44:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913134503] [2024-11-18 21:44:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913134503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:44:23,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:44:23,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 21:44:23,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867770366] [2024-11-18 21:44:23,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:44:23,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:44:23,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:44:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:44:23,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:44:23,499 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:44:28,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:44:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:44:28,676 INFO L93 Difference]: Finished difference Result 210 states and 331 transitions. [2024-11-18 21:44:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:44:28,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-11-18 21:44:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:44:28,681 INFO L225 Difference]: With dead ends: 210 [2024-11-18 21:44:28,681 INFO L226 Difference]: Without dead ends: 138 [2024-11-18 21:44:28,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:44:28,683 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 34 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:44:28,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 201 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-11-18 21:44:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-18 21:44:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2024-11-18 21:44:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-18 21:44:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 184 transitions. [2024-11-18 21:44:28,710 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 184 transitions. Word has length 149 [2024-11-18 21:44:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:44:28,711 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 184 transitions. [2024-11-18 21:44:28,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:44:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 184 transitions. [2024-11-18 21:44:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 21:44:28,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:44:28,716 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:44:28,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 21:44:28,916 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-18 21:44:28,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:44:28,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:44:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1322542602, now seen corresponding path program 1 times [2024-11-18 21:44:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:44:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932532626] [2024-11-18 21:44:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:44:28,919 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-18 21:44:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:44:28,922 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-18 21:44:28,926 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-18 21:44:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:44:29,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 21:44:29,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:44:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:44:36,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:44:36,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:44:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932532626] [2024-11-18 21:44:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932532626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:44:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:44:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 21:44:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212835089] [2024-11-18 21:44:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:44:36,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:44:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:44:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:44:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:44:36,200 INFO L87 Difference]: Start difference. First operand 120 states and 184 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:44:40,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:44:44,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:44:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:44:44,994 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2024-11-18 21:44:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:44:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-11-18 21:44:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:44:44,998 INFO L225 Difference]: With dead ends: 262 [2024-11-18 21:44:44,998 INFO L226 Difference]: Without dead ends: 190 [2024-11-18 21:44:44,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:44:45,002 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 36 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-18 21:44:45,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-18 21:44:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-18 21:44:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-18 21:44:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 21:44:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 288 transitions. [2024-11-18 21:44:45,048 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 288 transitions. Word has length 149 [2024-11-18 21:44:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:44:45,051 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 288 transitions. [2024-11-18 21:44:45,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-18 21:44:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 288 transitions. [2024-11-18 21:44:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 21:44:45,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:44:45,055 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:44:45,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 21:44:45,255 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-18 21:44:45,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:44:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:44:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1692561016, now seen corresponding path program 1 times [2024-11-18 21:44:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:44:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330222676] [2024-11-18 21:44:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:44:45,258 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-18 21:44:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:44:45,261 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-18 21:44:45,264 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-18 21:44:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:44:46,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 21:44:46,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:44:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-18 21:44:51,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:44:51,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:44:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330222676] [2024-11-18 21:44:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330222676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:44:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:44:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 21:44:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673253949] [2024-11-18 21:44:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:44:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:44:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:44:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:44:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:44:51,989 INFO L87 Difference]: Start difference. First operand 187 states and 288 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)