./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.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 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:28:59,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:28:59,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:28:59,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:28:59,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:28:59,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:28:59,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:28:59,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:28:59,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:28:59,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:28:59,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:28:59,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:28:59,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:28:59,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:28:59,958 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:28:59,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:28:59,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:28:59,959 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:28:59,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:28:59,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:28:59,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:28:59,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:28:59,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:28:59,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:28:59,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:28:59,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:28:59,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:28:59,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:28:59,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:28:59,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:28:59,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:28:59,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:28:59,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:28:59,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:28:59,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:28:59,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:28:59,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:28:59,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:28:59,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:28:59,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:28:59,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:28:59,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:28:59,967 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 -> 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a [2024-10-14 09:29:00,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:29:00,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:29:00,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:29:00,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:29:00,219 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:29:00,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-10-14 09:29:01,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:29:01,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:29:01,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-10-14 09:29:01,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f32e5132/bb9b6b31482f48958897d6929c18a4e4/FLAGddfe17b93 [2024-10-14 09:29:01,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f32e5132/bb9b6b31482f48958897d6929c18a4e4 [2024-10-14 09:29:01,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:29:01,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:29:01,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:29:01,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:29:01,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:29:01,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:29:01" (1/1) ... [2024-10-14 09:29:01,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4a25de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:01, skipping insertion in model container [2024-10-14 09:29:01,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:29:01" (1/1) ... [2024-10-14 09:29:01,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:29:01,919 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-10-14 09:29:01,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:29:01,994 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:29:02,002 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-10-14 09:29:02,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:29:02,056 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:29:02,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02 WrapperNode [2024-10-14 09:29:02,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:29:02,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:29:02,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:29:02,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:29:02,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,113 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 282 [2024-10-14 09:29:02,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:29:02,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:29:02,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:29:02,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:29:02,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,181 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-10-14 09:29:02,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:29:02,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:29:02,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:29:02,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:29:02,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (1/1) ... [2024-10-14 09:29:02,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:29:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:29:02,265 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-10-14 09:29:02,270 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-10-14 09:29:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:29:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:29:02,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:29:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:29:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:29:02,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:29:02,380 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:29:02,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:29:02,691 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 09:29:02,691 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:29:02,727 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:29:02,731 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:29:02,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:29:02 BoogieIcfgContainer [2024-10-14 09:29:02,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:29:02,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:29:02,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:29:02,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:29:02,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:29:01" (1/3) ... [2024-10-14 09:29:02,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc4bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:29:02, skipping insertion in model container [2024-10-14 09:29:02,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:02" (2/3) ... [2024-10-14 09:29:02,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc4bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:29:02, skipping insertion in model container [2024-10-14 09:29:02,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:29:02" (3/3) ... [2024-10-14 09:29:02,741 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-10-14 09:29:02,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:29:02,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:29:02,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:29:02,816 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;@402f153f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:29:02,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:29:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 78 states have internal predecessors, (118), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:29:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-14 09:29:02,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:02,833 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:02,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:02,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1317884479, now seen corresponding path program 1 times [2024-10-14 09:29:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138918848] [2024-10-14 09:29:02,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138918848] [2024-10-14 09:29:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138918848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:29:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756726729] [2024-10-14 09:29:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:03,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:29:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:29:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:29:03,367 INFO L87 Difference]: Start difference. First operand has 110 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 78 states have internal predecessors, (118), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 09:29:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:03,418 INFO L93 Difference]: Finished difference Result 215 states and 382 transitions. [2024-10-14 09:29:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:29:03,422 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 193 [2024-10-14 09:29:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:03,433 INFO L225 Difference]: With dead ends: 215 [2024-10-14 09:29:03,433 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 09:29:03,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-10-14 09:29:03,443 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:03,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:29:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 09:29:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-14 09:29:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:29:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-14 09:29:03,547 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 193 [2024-10-14 09:29:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:03,551 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-14 09:29:03,551 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 09:29:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-14 09:29:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-14 09:29:03,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:03,562 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:03,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:29:03,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:03,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:03,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1500979065, now seen corresponding path program 1 times [2024-10-14 09:29:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:03,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712777104] [2024-10-14 09:29:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712777104] [2024-10-14 09:29:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712777104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:04,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:29:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283271415] [2024-10-14 09:29:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:04,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:29:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:29:04,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:29:04,056 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:04,172 INFO L93 Difference]: Finished difference Result 316 states and 499 transitions. [2024-10-14 09:29:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:29:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-10-14 09:29:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:04,176 INFO L225 Difference]: With dead ends: 316 [2024-10-14 09:29:04,176 INFO L226 Difference]: Without dead ends: 211 [2024-10-14 09:29:04,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-10-14 09:29:04,177 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 153 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:04,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 441 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:29:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-14 09:29:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 143. [2024-10-14 09:29:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.4954954954954955) internal successors, (166), 111 states have internal predecessors, (166), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:29:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 226 transitions. [2024-10-14 09:29:04,193 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 226 transitions. Word has length 193 [2024-10-14 09:29:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 226 transitions. [2024-10-14 09:29:04,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 226 transitions. [2024-10-14 09:29:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 09:29:04,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:04,197 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:04,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:29:04,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:04,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1913335884, now seen corresponding path program 1 times [2024-10-14 09:29:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362978709] [2024-10-14 09:29:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:04,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362978709] [2024-10-14 09:29:04,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362978709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:04,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:04,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:29:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895303972] [2024-10-14 09:29:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:04,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:29:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:29:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:29:04,401 INFO L87 Difference]: Start difference. First operand 143 states and 226 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:04,425 INFO L93 Difference]: Finished difference Result 246 states and 384 transitions. [2024-10-14 09:29:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:29:04,426 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-14 09:29:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:04,429 INFO L225 Difference]: With dead ends: 246 [2024-10-14 09:29:04,429 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 09:29:04,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-10-14 09:29:04,431 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:04,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:29:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 09:29:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-14 09:29:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:29:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-10-14 09:29:04,442 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 194 [2024-10-14 09:29:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-10-14 09:29:04,443 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-10-14 09:29:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 09:29:04,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:04,445 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:04,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:29:04,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:04,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1779743180, now seen corresponding path program 1 times [2024-10-14 09:29:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973015658] [2024-10-14 09:29:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973015658] [2024-10-14 09:29:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973015658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:29:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978536504] [2024-10-14 09:29:04,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:04,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:29:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:29:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:29:04,772 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:05,072 INFO L93 Difference]: Finished difference Result 318 states and 477 transitions. [2024-10-14 09:29:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:29:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-14 09:29:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:05,076 INFO L225 Difference]: With dead ends: 318 [2024-10-14 09:29:05,076 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 09:29:05,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:29:05,080 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 298 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:05,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 740 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:29:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 09:29:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2024-10-14 09:29:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 145 states have internal predecessors, (191), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-14 09:29:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 315 transitions. [2024-10-14 09:29:05,146 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 315 transitions. Word has length 195 [2024-10-14 09:29:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 315 transitions. [2024-10-14 09:29:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 315 transitions. [2024-10-14 09:29:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 09:29:05,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:05,150 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:29:05,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:05,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -191395278, now seen corresponding path program 1 times [2024-10-14 09:29:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314896941] [2024-10-14 09:29:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314896941] [2024-10-14 09:29:05,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314896941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:05,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:05,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:29:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414629632] [2024-10-14 09:29:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:05,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:29:05,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:29:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:29:05,406 INFO L87 Difference]: Start difference. First operand 210 states and 315 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:05,621 INFO L93 Difference]: Finished difference Result 710 states and 1062 transitions. [2024-10-14 09:29:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:29:05,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-14 09:29:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:05,628 INFO L225 Difference]: With dead ends: 710 [2024-10-14 09:29:05,629 INFO L226 Difference]: Without dead ends: 504 [2024-10-14 09:29:05,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 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-10-14 09:29:05,631 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 335 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:05,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 457 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:29:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-14 09:29:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 241. [2024-10-14 09:29:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 174 states have (on average 1.3850574712643677) internal successors, (241), 176 states have internal predecessors, (241), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-14 09:29:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 365 transitions. [2024-10-14 09:29:05,697 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 365 transitions. Word has length 195 [2024-10-14 09:29:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:05,705 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 365 transitions. [2024-10-14 09:29:05,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 365 transitions. [2024-10-14 09:29:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 09:29:05,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:05,707 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:05,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:29:05,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1608062668, now seen corresponding path program 1 times [2024-10-14 09:29:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640051610] [2024-10-14 09:29:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640051610] [2024-10-14 09:29:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640051610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:29:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389719316] [2024-10-14 09:29:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:06,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:29:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:29:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:29:06,409 INFO L87 Difference]: Start difference. First operand 241 states and 365 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:06,850 INFO L93 Difference]: Finished difference Result 640 states and 970 transitions. [2024-10-14 09:29:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:29:06,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-14 09:29:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:06,853 INFO L225 Difference]: With dead ends: 640 [2024-10-14 09:29:06,853 INFO L226 Difference]: Without dead ends: 403 [2024-10-14 09:29:06,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:29:06,855 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 351 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:06,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 840 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:29:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-14 09:29:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 238. [2024-10-14 09:29:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 175 states have internal predecessors, (245), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 365 transitions. [2024-10-14 09:29:06,895 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 365 transitions. Word has length 195 [2024-10-14 09:29:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:06,896 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 365 transitions. [2024-10-14 09:29:06,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 365 transitions. [2024-10-14 09:29:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 09:29:06,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:06,898 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:06,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:29:06,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:06,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1929077094, now seen corresponding path program 1 times [2024-10-14 09:29:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402434980] [2024-10-14 09:29:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:06,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:07,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:07,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402434980] [2024-10-14 09:29:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402434980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:07,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 09:29:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662802665] [2024-10-14 09:29:07,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:07,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:29:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:07,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:29:07,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:29:07,959 INFO L87 Difference]: Start difference. First operand 238 states and 365 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-14 09:29:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:08,718 INFO L93 Difference]: Finished difference Result 539 states and 810 transitions. [2024-10-14 09:29:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:29:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 196 [2024-10-14 09:29:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:08,721 INFO L225 Difference]: With dead ends: 539 [2024-10-14 09:29:08,721 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 09:29:08,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-14 09:29:08,724 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 459 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:08,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 373 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:29:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 09:29:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 260. [2024-10-14 09:29:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 194 states have internal predecessors, (262), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2024-10-14 09:29:08,768 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 196 [2024-10-14 09:29:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:08,770 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2024-10-14 09:29:08,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-14 09:29:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2024-10-14 09:29:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 09:29:08,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:08,772 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:08,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:29:08,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:08,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -71845542, now seen corresponding path program 1 times [2024-10-14 09:29:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025715318] [2024-10-14 09:29:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025715318] [2024-10-14 09:29:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025715318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:09,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:29:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099618114] [2024-10-14 09:29:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:29:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:29:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:29:09,256 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:09,628 INFO L93 Difference]: Finished difference Result 466 states and 682 transitions. [2024-10-14 09:29:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:29:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-14 09:29:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:09,630 INFO L225 Difference]: With dead ends: 466 [2024-10-14 09:29:09,630 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 09:29:09,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:29:09,631 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 175 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:09,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 455 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:29:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 09:29:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 218. [2024-10-14 09:29:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 151 states have (on average 1.2980132450331126) internal successors, (196), 152 states have internal predecessors, (196), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 316 transitions. [2024-10-14 09:29:09,665 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 316 transitions. Word has length 196 [2024-10-14 09:29:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:09,666 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 316 transitions. [2024-10-14 09:29:09,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 316 transitions. [2024-10-14 09:29:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 09:29:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:09,668 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:09,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 09:29:09,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:09,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1143549950, now seen corresponding path program 1 times [2024-10-14 09:29:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:09,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977137105] [2024-10-14 09:29:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:10,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977137105] [2024-10-14 09:29:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977137105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:10,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:10,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:29:10,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48611312] [2024-10-14 09:29:10,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:10,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:29:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:29:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:29:10,185 INFO L87 Difference]: Start difference. First operand 218 states and 316 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:10,625 INFO L93 Difference]: Finished difference Result 526 states and 754 transitions. [2024-10-14 09:29:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:29:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-10-14 09:29:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:10,628 INFO L225 Difference]: With dead ends: 526 [2024-10-14 09:29:10,628 INFO L226 Difference]: Without dead ends: 364 [2024-10-14 09:29:10,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:29:10,629 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 264 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:10,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 539 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:29:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-14 09:29:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 358. [2024-10-14 09:29:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 257 states have (on average 1.2957198443579767) internal successors, (333), 258 states have internal predecessors, (333), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 09:29:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2024-10-14 09:29:10,701 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 199 [2024-10-14 09:29:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:10,702 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2024-10-14 09:29:10,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2024-10-14 09:29:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 09:29:10,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:10,703 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:10,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 09:29:10,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -428380578, now seen corresponding path program 1 times [2024-10-14 09:29:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311217475] [2024-10-14 09:29:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311217475] [2024-10-14 09:29:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311217475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:11,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:29:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815357161] [2024-10-14 09:29:11,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:11,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:29:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:29:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:29:11,270 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-14 09:29:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:11,600 INFO L93 Difference]: Finished difference Result 498 states and 707 transitions. [2024-10-14 09:29:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:29:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 203 [2024-10-14 09:29:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:11,602 INFO L225 Difference]: With dead ends: 498 [2024-10-14 09:29:11,602 INFO L226 Difference]: Without dead ends: 196 [2024-10-14 09:29:11,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:29:11,604 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 291 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:11,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:29:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-14 09:29:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2024-10-14 09:29:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 109 states have (on average 1.146788990825688) internal successors, (125), 110 states have internal predecessors, (125), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2024-10-14 09:29:11,632 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 203 [2024-10-14 09:29:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:11,633 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2024-10-14 09:29:11,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-10-14 09:29:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2024-10-14 09:29:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 09:29:11,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:11,634 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:11,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 09:29:11,635 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:11,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1353465971, now seen corresponding path program 1 times [2024-10-14 09:29:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335070742] [2024-10-14 09:29:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:29:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:29:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:29:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:29:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:29:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:29:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:29:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:29:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:29:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:29:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:29:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:29:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:29:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:29:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:29:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:29:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:29:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:29:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:29:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:29:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:29:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:29:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:29:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:29:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:29:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:29:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 09:29:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:29:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 09:29:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:29:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 09:29:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:29:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335070742] [2024-10-14 09:29:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335070742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:29:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436941003] [2024-10-14 09:29:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:11,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:29:11,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:29:11,980 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-10-14 09:29:11,981 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-10-14 09:29:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:12,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 09:29:12,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:29:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 593 proven. 69 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2024-10-14 09:29:12,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:29:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 09:29:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436941003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:29:12,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:29:12,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-14 09:29:12,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517918433] [2024-10-14 09:29:12,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:29:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 09:29:12,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:29:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 09:29:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:29:12,607 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-14 09:29:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:13,101 INFO L93 Difference]: Finished difference Result 318 states and 425 transitions. [2024-10-14 09:29:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 09:29:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 203 [2024-10-14 09:29:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:13,104 INFO L225 Difference]: With dead ends: 318 [2024-10-14 09:29:13,104 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 09:29:13,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:29:13,107 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 325 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:13,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 284 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:29:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 09:29:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2024-10-14 09:29:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 118 states have (on average 1.1271186440677967) internal successors, (133), 119 states have internal predecessors, (133), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 253 transitions. [2024-10-14 09:29:13,186 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 253 transitions. Word has length 203 [2024-10-14 09:29:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:13,186 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 253 transitions. [2024-10-14 09:29:13,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-14 09:29:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 253 transitions. [2024-10-14 09:29:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 09:29:13,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:13,189 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:13,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 09:29:13,394 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,SelfDestructingSolverStorable10 [2024-10-14 09:29:13,394 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:13,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1198159207, now seen corresponding path program 1 times [2024-10-14 09:29:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:29:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522507560] [2024-10-14 09:29:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:29:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:29:13,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:29:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:29:13,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:29:13,617 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:29:13,618 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:29:13,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 09:29:13,622 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:29:13,764 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:29:13,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:29:13 BoogieIcfgContainer [2024-10-14 09:29:13,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:29:13,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:29:13,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:29:13,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:29:13,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:29:02" (3/4) ... [2024-10-14 09:29:13,777 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:29:13,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:29:13,779 INFO L158 Benchmark]: Toolchain (without parser) took 12033.71ms. Allocated memory was 144.7MB in the beginning and 555.7MB in the end (delta: 411.0MB). Free memory was 76.7MB in the beginning and 364.3MB in the end (delta: -287.6MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2024-10-14 09:29:13,779 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 144.7MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:29:13,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 144.7MB. Free memory was 76.6MB in the beginning and 60.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:29:13,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.60ms. Allocated memory is still 144.7MB. Free memory was 60.1MB in the beginning and 56.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:29:13,780 INFO L158 Benchmark]: Boogie Preprocessor took 105.61ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 56.0MB in the beginning and 174.5MB in the end (delta: -118.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-14 09:29:13,780 INFO L158 Benchmark]: RCFGBuilder took 512.40ms. Allocated memory is still 207.6MB. Free memory was 174.5MB in the beginning and 141.8MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 09:29:13,780 INFO L158 Benchmark]: TraceAbstraction took 11035.79ms. Allocated memory was 207.6MB in the beginning and 555.7MB in the end (delta: 348.1MB). Free memory was 141.8MB in the beginning and 364.3MB in the end (delta: -222.5MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2024-10-14 09:29:13,780 INFO L158 Benchmark]: Witness Printer took 8.01ms. Allocated memory is still 555.7MB. Free memory is still 364.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:29:13,781 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.08ms. Allocated memory is still 144.7MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 144.7MB. Free memory was 76.6MB in the beginning and 60.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.60ms. Allocated memory is still 144.7MB. Free memory was 60.1MB in the beginning and 56.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.61ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 56.0MB in the beginning and 174.5MB in the end (delta: -118.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * RCFGBuilder took 512.40ms. Allocated memory is still 207.6MB. Free memory was 174.5MB in the beginning and 141.8MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11035.79ms. Allocated memory was 207.6MB in the beginning and 555.7MB in the end (delta: 348.1MB). Free memory was 141.8MB in the beginning and 364.3MB in the end (delta: -222.5MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. * Witness Printer took 8.01ms. Allocated memory is still 555.7MB. Free memory is still 364.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of bitwiseOr at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] signed char var_1_32 = 64; [L43] unsigned short int var_1_33 = 16; [L44] unsigned short int var_1_35 = 1; [L45] unsigned char var_1_39 = 4; [L46] unsigned char var_1_40 = 32; [L47] signed long int var_1_41 = -5; [L48] double var_1_42 = 49.6; [L49] double var_1_43 = 49.6; [L50] double var_1_44 = 8.2; [L51] signed long int var_1_45 = -2; [L52] unsigned long int var_1_47 = 16; [L53] unsigned long int var_1_50 = 1275815169; [L54] unsigned long int var_1_51 = 1483937619; [L55] signed short int last_1_var_1_1 = 4; [L56] unsigned char last_1_var_1_14 = 1; [L57] signed char last_1_var_1_16 = 50; [L58] signed long int last_1_var_1_23 = -16; [L59] unsigned char last_1_var_1_24 = 1; [L60] double last_1_var_1_28 = 5.5; [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L195] last_1_var_1_1 = var_1_1 [L196] last_1_var_1_14 = var_1_14 [L197] last_1_var_1_16 = var_1_16 [L198] last_1_var_1_23 = var_1_23 [L199] last_1_var_1_24 = var_1_24 [L200] last_1_var_1_28 = var_1_28 [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_11 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] var_1_12 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] var_1_13 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_19 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] var_1_21 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] var_1_25 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] var_1_26 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L170] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L171] var_1_27 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L172] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L173] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L173] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=64, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L174] var_1_32 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_32 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L175] RET assume_abort_if_not(var_1_32 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L176] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L176] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=1, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L177] var_1_35 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L178] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L179] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L179] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=32, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L180] var_1_40 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L181] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L182] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L182] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_43=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L183] var_1_43 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_43 >= -922337.2036854765600e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L184] RET assume_abort_if_not((var_1_43 >= -922337.2036854765600e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_44=41/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L185] var_1_44 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L186] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L187] var_1_50 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L188] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L189] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L189] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L190] var_1_51 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L191] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L192] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L192] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L211] RET updateVariables() [L212] CALL step() [L64] signed long int stepLocal_3 = last_1_var_1_23; [L65] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L66] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L77] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L79] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L79] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L80] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L84] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L85] var_1_28 = var_1_21 [L86] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L87] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L88] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=1, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L92] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L93] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L94] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L94] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L95] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L97] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L98] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=50, var_1_31=4, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L102] var_1_29 = var_1_16 [L103] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L104] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=16, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L109] COND TRUE ((((var_1_20) < (var_1_20)) ? (var_1_20) : (var_1_20))) < var_1_28 [L110] var_1_33 = var_1_35 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=4, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L113] var_1_39 = var_1_40 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L114] COND TRUE var_1_1 != var_1_8 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L115] EXPR -5 | var_1_8 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L115] COND TRUE (-5 | var_1_8) <= var_1_32 [L116] var_1_41 = ((((var_1_23) > (var_1_23)) ? (var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L119] COND FALSE !(1000000.4f != var_1_20) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L124] COND FALSE !(var_1_24 && var_1_24) [L127] var_1_45 = ((var_1_32 + var_1_1) + var_1_40) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L129] COND FALSE !(var_1_20 < var_1_43) [L142] var_1_47 = var_1_1 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L212] RET step() [L213] CALL, EXPR property() [L203] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L203-L204] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=-32762, var_1_24=0, var_1_25=-1, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=100, var_1_31=126, var_1_32=126, var_1_33=-2, var_1_35=-2, var_1_39=-2, var_1_40=-2, var_1_41=-32762, var_1_42=248/5, var_1_45=680, var_1_47=300, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2658 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2651 mSDsluCounter, 4821 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2497 mSDsCounter, 764 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1932 IncrementalHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 764 mSolverCounterUnsat, 2324 mSDtfsCounter, 1932 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1196 GetRequests, 1131 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 674 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2569 NumberOfCodeBlocks, 2569 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2555 ConstructedInterpolants, 0 QuantifiedInterpolants, 11745 SizeOfPredicates, 4 NumberOfNonLiveVariables, 479 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 22413/22620 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-10-14 09:29:13,826 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.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 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:29:16,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:29:16,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:29:16,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:29:16,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:29:16,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:29:16,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:29:16,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:29:16,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:29:16,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:29:16,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:29:16,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:29:16,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:29:16,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:29:16,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:29:16,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:29:16,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:29:16,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:29:16,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:29:16,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:29:16,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:29:16,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:29:16,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:29:16,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:29:16,220 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:29:16,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:29:16,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:29:16,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:29:16,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:29:16,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:29:16,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:29:16,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:29:16,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:29:16,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:29:16,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:29:16,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:29:16,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:29:16,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:29:16,222 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:29:16,223 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:29:16,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:29:16,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:29:16,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:29:16,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:29:16,224 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:29:16,224 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 -> 4679e818c2a87d1f6ceadee5a436eeb96f16b48c4384e7075e733b0d1dd8bd5a [2024-10-14 09:29:16,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:29:16,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:29:16,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:29:16,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:29:16,497 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:29:16,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-10-14 09:29:17,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:29:18,139 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:29:18,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-10-14 09:29:18,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904340767/d10a4b01c3694ed6b270305925e7caa9/FLAG0a3c4338c [2024-10-14 09:29:18,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/904340767/d10a4b01c3694ed6b270305925e7caa9 [2024-10-14 09:29:18,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:29:18,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:29:18,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:29:18,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:29:18,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:29:18,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4a8740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18, skipping insertion in model container [2024-10-14 09:29:18,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:29:18,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-10-14 09:29:18,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:29:18,424 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:29:18,436 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i[919,932] [2024-10-14 09:29:18,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:29:18,509 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:29:18,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18 WrapperNode [2024-10-14 09:29:18,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:29:18,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:29:18,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:29:18,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:29:18,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,560 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-14 09:29:18,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:29:18,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:29:18,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:29:18,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:29:18,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,604 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-10-14 09:29:18,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:29:18,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:29:18,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:29:18,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:29:18,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (1/1) ... [2024-10-14 09:29:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:29:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:29:18,658 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-10-14 09:29:18,661 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-10-14 09:29:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:29:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:29:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:29:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:29:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:29:18,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:29:18,806 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:29:18,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:29:19,962 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-14 09:29:19,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:29:20,002 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:29:20,003 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:29:20,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:29:20 BoogieIcfgContainer [2024-10-14 09:29:20,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:29:20,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:29:20,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:29:20,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:29:20,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:29:18" (1/3) ... [2024-10-14 09:29:20,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4286cc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:29:20, skipping insertion in model container [2024-10-14 09:29:20,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:29:18" (2/3) ... [2024-10-14 09:29:20,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4286cc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:29:20, skipping insertion in model container [2024-10-14 09:29:20,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:29:20" (3/3) ... [2024-10-14 09:29:20,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-65.i [2024-10-14 09:29:20,035 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:29:20,035 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:29:20,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:29:20,102 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;@1b36b34c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:29:20,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:29:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:29:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 09:29:20,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:20,122 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:20,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:20,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1499988331, now seen corresponding path program 1 times [2024-10-14 09:29:20,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:29:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688623290] [2024-10-14 09:29:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:20,140 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-10-14 09:29:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:29:20,144 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-10-14 09:29:20,145 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-10-14 09:29:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:20,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:29:20,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:29:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2024-10-14 09:29:20,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:29:20,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:29:20,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688623290] [2024-10-14 09:29:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688623290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:29:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565829406] [2024-10-14 09:29:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:29:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:29:20,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:29:20,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:29:20,508 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 09:29:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:20,961 INFO L93 Difference]: Finished difference Result 165 states and 300 transitions. [2024-10-14 09:29:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:29:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 187 [2024-10-14 09:29:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:20,982 INFO L225 Difference]: With dead ends: 165 [2024-10-14 09:29:20,984 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 09:29:20,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-10-14 09:29:20,991 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:20,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:29:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 09:29:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 09:29:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:29:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 130 transitions. [2024-10-14 09:29:21,035 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 130 transitions. Word has length 187 [2024-10-14 09:29:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:21,035 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 130 transitions. [2024-10-14 09:29:21,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 09:29:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 130 transitions. [2024-10-14 09:29:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 09:29:21,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:21,040 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:21,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:29:21,241 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-10-14 09:29:21,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:21,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1288561373, now seen corresponding path program 1 times [2024-10-14 09:29:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:29:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534617752] [2024-10-14 09:29:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:21,248 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-10-14 09:29:21,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:29:21,251 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-10-14 09:29:21,252 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-10-14 09:29:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:21,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:29:21,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:29:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 593 proven. 69 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2024-10-14 09:29:21,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:29:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 09:29:22,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:29:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534617752] [2024-10-14 09:29:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534617752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:29:22,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:29:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-14 09:29:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295161833] [2024-10-14 09:29:22,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:29:22,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 09:29:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:29:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 09:29:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:29:22,121 INFO L87 Difference]: Start difference. First operand 82 states and 130 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-14 09:29:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:23,589 INFO L93 Difference]: Finished difference Result 181 states and 282 transitions. [2024-10-14 09:29:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 09:29:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 187 [2024-10-14 09:29:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:23,594 INFO L225 Difference]: With dead ends: 181 [2024-10-14 09:29:23,594 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 09:29:23,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-14 09:29:23,599 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 237 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:23,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 233 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 09:29:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 09:29:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-10-14 09:29:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 09:29:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-10-14 09:29:23,629 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 187 [2024-10-14 09:29:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-10-14 09:29:23,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2024-10-14 09:29:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-10-14 09:29:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 09:29:23,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:23,639 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:23,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 09:29:23,839 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-10-14 09:29:23,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:23,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2101015546, now seen corresponding path program 1 times [2024-10-14 09:29:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:29:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178173044] [2024-10-14 09:29:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:23,845 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-10-14 09:29:23,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:29:23,848 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-10-14 09:29:23,849 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-10-14 09:29:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:24,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:29:24,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:29:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 879 proven. 36 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2024-10-14 09:29:24,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:29:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 09:29:24,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:29:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178173044] [2024-10-14 09:29:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178173044] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:29:24,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:29:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-14 09:29:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368316145] [2024-10-14 09:29:24,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:29:24,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:29:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:29:24,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:29:24,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:29:24,437 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-10-14 09:29:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:25,723 INFO L93 Difference]: Finished difference Result 250 states and 370 transitions. [2024-10-14 09:29:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 09:29:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 188 [2024-10-14 09:29:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:25,726 INFO L225 Difference]: With dead ends: 250 [2024-10-14 09:29:25,726 INFO L226 Difference]: Without dead ends: 165 [2024-10-14 09:29:25,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:29:25,728 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 127 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:25,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 352 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 09:29:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-14 09:29:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2024-10-14 09:29:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-10-14 09:29:25,747 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 188 [2024-10-14 09:29:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:25,748 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-10-14 09:29:25,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-10-14 09:29:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-10-14 09:29:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 09:29:25,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:25,750 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:25,760 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-10-14 09:29:25,954 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-10-14 09:29:25,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -787660872, now seen corresponding path program 1 times [2024-10-14 09:29:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:29:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299058439] [2024-10-14 09:29:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:25,960 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-10-14 09:29:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:29:25,961 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-10-14 09:29:25,963 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-10-14 09:29:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:26,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:29:26,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:29:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 09:29:26,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:29:26,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:29:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299058439] [2024-10-14 09:29:26,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299058439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:29:26,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:29:26,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:29:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505029508] [2024-10-14 09:29:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:29:26,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:29:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:29:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:29:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:29:26,492 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:29:27,657 INFO L93 Difference]: Finished difference Result 327 states and 473 transitions. [2024-10-14 09:29:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:29:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-10-14 09:29:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:29:27,662 INFO L225 Difference]: With dead ends: 327 [2024-10-14 09:29:27,662 INFO L226 Difference]: Without dead ends: 240 [2024-10-14 09:29:27,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:29:27,663 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 165 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:29:27,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 290 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 09:29:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-14 09:29:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 159. [2024-10-14 09:29:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.173913043478261) internal successors, (108), 93 states have internal predecessors, (108), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:29:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2024-10-14 09:29:27,699 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 188 [2024-10-14 09:29:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:29:27,700 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2024-10-14 09:29:27,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 09:29:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2024-10-14 09:29:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-14 09:29:27,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:29:27,702 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:29:27,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 09:29:27,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:29:27,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:29:27,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:29:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2103714902, now seen corresponding path program 1 times [2024-10-14 09:29:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:29:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749038072] [2024-10-14 09:29:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:29:27,908 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-10-14 09:29:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:29:27,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:29:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 09:29:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:29:28,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 09:29:28,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:29:51,418 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 09:30:14,587 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)