./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.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 c576a24d45ab301447d14f0f509fbb4fda0d590a05a36555d57f7b59c4fd472a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:53:27,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:53:27,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:53:27,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:53:27,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:53:27,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:53:27,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:53:27,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:53:27,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:53:27,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:53:27,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:53:27,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:53:27,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:53:27,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:53:27,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:53:27,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:53:27,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:53:27,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:53:27,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:53:27,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:53:27,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:53:27,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:53:27,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:53:27,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:53:27,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:53:27,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:53:27,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:53:27,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:53:27,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:53:27,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:53:27,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:53:27,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:53:27,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:53:27,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:53:27,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:53:27,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:53:27,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:53:27,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:53:27,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:53:27,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:53:27,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:53:27,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:53:27,659 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 -> c576a24d45ab301447d14f0f509fbb4fda0d590a05a36555d57f7b59c4fd472a [2024-11-10 04:53:27,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:53:27,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:53:27,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:53:27,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:53:27,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:53:27,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i [2024-11-10 04:53:29,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:53:29,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:53:29,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i [2024-11-10 04:53:29,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a024cdd9e/1255f19cdaca446fb470d96e0e759968/FLAG989dda77a [2024-11-10 04:53:29,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a024cdd9e/1255f19cdaca446fb470d96e0e759968 [2024-11-10 04:53:29,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:53:29,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:53:29,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:53:29,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:53:29,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:53:29,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:53:29" (1/1) ... [2024-11-10 04:53:29,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12978e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:29, skipping insertion in model container [2024-11-10 04:53:29,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:53:29" (1/1) ... [2024-11-10 04:53:29,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:53:29,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i[918,931] [2024-11-10 04:53:30,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:53:30,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:53:30,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i[918,931] [2024-11-10 04:53:30,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:53:30,147 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:53:30,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30 WrapperNode [2024-11-10 04:53:30,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:53:30,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:53:30,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:53:30,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:53:30,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,219 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2024-11-10 04:53:30,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:53:30,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:53:30,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:53:30,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:53:30,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:53:30,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:53:30,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:53:30,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:53:30,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:53:30,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (1/1) ... [2024-11-10 04:53:30,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:53:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:30,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:53:30,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:53:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:53:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:53:30,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:53:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:53:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:53:30,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:53:30,495 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:53:30,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:53:30,994 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2024-11-10 04:53:31,042 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 04:53:31,042 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:53:31,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:53:31,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:53:31,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:31 BoogieIcfgContainer [2024-11-10 04:53:31,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:53:31,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:53:31,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:53:31,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:53:31,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:53:29" (1/3) ... [2024-11-10 04:53:31,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19eb1629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:53:31, skipping insertion in model container [2024-11-10 04:53:31,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:30" (2/3) ... [2024-11-10 04:53:31,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19eb1629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:53:31, skipping insertion in model container [2024-11-10 04:53:31,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:31" (3/3) ... [2024-11-10 04:53:31,088 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i [2024-11-10 04:53:31,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:53:31,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:53:31,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:53:31,189 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;@21cb32c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:53:31,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:53:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 84 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 04:53:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 04:53:31,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:31,209 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:31,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:31,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 934367357, now seen corresponding path program 1 times [2024-11-10 04:53:31,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381355225] [2024-11-10 04:53:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381355225] [2024-11-10 04:53:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381355225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:53:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766201918] [2024-11-10 04:53:31,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:31,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:53:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:53:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:53:31,805 INFO L87 Difference]: Start difference. First operand has 109 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 84 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:53:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:31,845 INFO L93 Difference]: Finished difference Result 210 states and 362 transitions. [2024-11-10 04:53:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:53:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-10 04:53:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:31,860 INFO L225 Difference]: With dead ends: 210 [2024-11-10 04:53:31,860 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 04:53:31,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:53:31,869 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:31,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:53:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 04:53:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 04:53:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 79 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 04:53:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2024-11-10 04:53:31,920 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 162 [2024-11-10 04:53:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:31,920 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2024-11-10 04:53:31,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:53:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2024-11-10 04:53:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 04:53:31,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:31,927 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:31,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:53:31,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:31,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1995021534, now seen corresponding path program 1 times [2024-11-10 04:53:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658196264] [2024-11-10 04:53:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:32,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:32,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658196264] [2024-11-10 04:53:32,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658196264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:32,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:53:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309419921] [2024-11-10 04:53:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:32,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:53:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:32,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:53:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:32,623 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:32,747 INFO L93 Difference]: Finished difference Result 306 states and 486 transitions. [2024-11-10 04:53:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:53:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-10 04:53:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:32,755 INFO L225 Difference]: With dead ends: 306 [2024-11-10 04:53:32,755 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 04:53:32,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:32,758 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 108 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:32,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 340 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:53:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 04:53:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-11-10 04:53:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.4705882352941178) internal successors, (225), 153 states have internal predecessors, (225), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 04:53:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 317 transitions. [2024-11-10 04:53:32,799 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 317 transitions. Word has length 162 [2024-11-10 04:53:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:32,799 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 317 transitions. [2024-11-10 04:53:32,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 317 transitions. [2024-11-10 04:53:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 04:53:32,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:32,803 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:53:32,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1580582433, now seen corresponding path program 1 times [2024-11-10 04:53:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449870726] [2024-11-10 04:53:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:32,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:32,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449870726] [2024-11-10 04:53:32,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449870726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:32,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:33,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:53:33,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166417529] [2024-11-10 04:53:33,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:33,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:53:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:53:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:33,004 INFO L87 Difference]: Start difference. First operand 202 states and 317 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:33,103 INFO L93 Difference]: Finished difference Result 514 states and 807 transitions. [2024-11-10 04:53:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:53:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2024-11-10 04:53:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:33,112 INFO L225 Difference]: With dead ends: 514 [2024-11-10 04:53:33,112 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 04:53:33,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:33,117 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 83 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:33,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 318 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:53:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 04:53:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2024-11-10 04:53:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 235 states have (on average 1.5021276595744681) internal successors, (353), 235 states have internal predecessors, (353), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 04:53:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 445 transitions. [2024-11-10 04:53:33,154 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 445 transitions. Word has length 163 [2024-11-10 04:53:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:33,155 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 445 transitions. [2024-11-10 04:53:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 445 transitions. [2024-11-10 04:53:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 04:53:33,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:33,158 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:33,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:53:33,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:33,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1723877982, now seen corresponding path program 1 times [2024-11-10 04:53:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615222189] [2024-11-10 04:53:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615222189] [2024-11-10 04:53:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615222189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 04:53:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658140219] [2024-11-10 04:53:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:53:33,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:33,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:53:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:53:33,582 INFO L87 Difference]: Start difference. First operand 284 states and 445 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:33,893 INFO L93 Difference]: Finished difference Result 711 states and 1120 transitions. [2024-11-10 04:53:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:53:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2024-11-10 04:53:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:33,901 INFO L225 Difference]: With dead ends: 711 [2024-11-10 04:53:33,901 INFO L226 Difference]: Without dead ends: 569 [2024-11-10 04:53:33,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:53:33,905 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 118 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:33,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 633 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:53:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-10 04:53:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 562. [2024-11-10 04:53:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 465 states have (on average 1.5075268817204301) internal successors, (701), 465 states have internal predecessors, (701), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 04:53:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 885 transitions. [2024-11-10 04:53:33,955 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 885 transitions. Word has length 164 [2024-11-10 04:53:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:33,957 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 885 transitions. [2024-11-10 04:53:33,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 885 transitions. [2024-11-10 04:53:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 04:53:33,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:33,961 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:33,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:53:33,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:33,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1400910178, now seen corresponding path program 1 times [2024-11-10 04:53:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:33,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009400634] [2024-11-10 04:53:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009400634] [2024-11-10 04:53:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009400634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:53:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309275956] [2024-11-10 04:53:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:34,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:53:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:53:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:34,133 INFO L87 Difference]: Start difference. First operand 562 states and 885 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:34,264 INFO L93 Difference]: Finished difference Result 1640 states and 2599 transitions. [2024-11-10 04:53:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:53:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2024-11-10 04:53:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:34,274 INFO L225 Difference]: With dead ends: 1640 [2024-11-10 04:53:34,275 INFO L226 Difference]: Without dead ends: 1081 [2024-11-10 04:53:34,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:34,278 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 144 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:34,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 400 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:53:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-10 04:53:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1074. [2024-11-10 04:53:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 881 states have (on average 1.492622020431328) internal successors, (1315), 881 states have internal predecessors, (1315), 184 states have call successors, (184), 8 states have call predecessors, (184), 8 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2024-11-10 04:53:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1683 transitions. [2024-11-10 04:53:34,346 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1683 transitions. Word has length 164 [2024-11-10 04:53:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:34,347 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1683 transitions. [2024-11-10 04:53:34,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1683 transitions. [2024-11-10 04:53:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:53:34,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:34,351 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:34,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:53:34,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 267536187, now seen corresponding path program 1 times [2024-11-10 04:53:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934018614] [2024-11-10 04:53:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934018614] [2024-11-10 04:53:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934018614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:53:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782655056] [2024-11-10 04:53:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:53:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:53:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:53:34,963 INFO L87 Difference]: Start difference. First operand 1074 states and 1683 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:53:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:35,718 INFO L93 Difference]: Finished difference Result 2405 states and 3713 transitions. [2024-11-10 04:53:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:53:35,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 165 [2024-11-10 04:53:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:35,729 INFO L225 Difference]: With dead ends: 2405 [2024-11-10 04:53:35,729 INFO L226 Difference]: Without dead ends: 2134 [2024-11-10 04:53:35,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:53:35,732 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 401 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:35,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 451 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:53:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2024-11-10 04:53:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1804. [2024-11-10 04:53:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1587 states have (on average 1.5129174543163202) internal successors, (2401), 1595 states have internal predecessors, (2401), 200 states have call successors, (200), 16 states have call predecessors, (200), 16 states have return successors, (200), 192 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-10 04:53:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2801 transitions. [2024-11-10 04:53:35,842 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2801 transitions. Word has length 165 [2024-11-10 04:53:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:35,842 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2801 transitions. [2024-11-10 04:53:35,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:53:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2801 transitions. [2024-11-10 04:53:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:53:35,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:35,846 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:35,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:53:35,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:35,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash -518372350, now seen corresponding path program 1 times [2024-11-10 04:53:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:35,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025028324] [2024-11-10 04:53:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:36,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025028324] [2024-11-10 04:53:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025028324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:36,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:53:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044032470] [2024-11-10 04:53:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:53:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:36,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:53:36,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:53:36,228 INFO L87 Difference]: Start difference. First operand 1804 states and 2801 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:36,666 INFO L93 Difference]: Finished difference Result 5739 states and 8951 transitions. [2024-11-10 04:53:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:53:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2024-11-10 04:53:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:36,687 INFO L225 Difference]: With dead ends: 5739 [2024-11-10 04:53:36,688 INFO L226 Difference]: Without dead ends: 3938 [2024-11-10 04:53:36,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:53:36,698 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 312 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:36,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 602 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:53:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-11-10 04:53:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3260. [2024-11-10 04:53:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 2935 states have (on average 1.5165247018739352) internal successors, (4451), 2947 states have internal predecessors, (4451), 300 states have call successors, (300), 24 states have call predecessors, (300), 24 states have return successors, (300), 288 states have call predecessors, (300), 300 states have call successors, (300) [2024-11-10 04:53:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 5051 transitions. [2024-11-10 04:53:36,896 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 5051 transitions. Word has length 165 [2024-11-10 04:53:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:36,896 INFO L471 AbstractCegarLoop]: Abstraction has 3260 states and 5051 transitions. [2024-11-10 04:53:36,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 5051 transitions. [2024-11-10 04:53:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:53:36,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:36,901 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:36,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 04:53:36,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:36,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1388156990, now seen corresponding path program 1 times [2024-11-10 04:53:36,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:36,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215819080] [2024-11-10 04:53:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215819080] [2024-11-10 04:53:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215819080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:53:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777363067] [2024-11-10 04:53:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:37,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:53:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:53:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:53:37,641 INFO L87 Difference]: Start difference. First operand 3260 states and 5051 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:38,331 INFO L93 Difference]: Finished difference Result 7040 states and 10835 transitions. [2024-11-10 04:53:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:53:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2024-11-10 04:53:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:38,356 INFO L225 Difference]: With dead ends: 7040 [2024-11-10 04:53:38,356 INFO L226 Difference]: Without dead ends: 5181 [2024-11-10 04:53:38,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:53:38,363 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 325 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:38,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 452 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:53:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2024-11-10 04:53:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 4986. [2024-11-10 04:53:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4986 states, 4525 states have (on average 1.5122651933701658) internal successors, (6843), 4557 states have internal predecessors, (6843), 416 states have call successors, (416), 44 states have call predecessors, (416), 44 states have return successors, (416), 384 states have call predecessors, (416), 416 states have call successors, (416) [2024-11-10 04:53:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 7675 transitions. [2024-11-10 04:53:38,646 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 7675 transitions. Word has length 165 [2024-11-10 04:53:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:38,647 INFO L471 AbstractCegarLoop]: Abstraction has 4986 states and 7675 transitions. [2024-11-10 04:53:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 7675 transitions. [2024-11-10 04:53:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:53:38,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:38,652 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 04:53:38,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 579866491, now seen corresponding path program 1 times [2024-11-10 04:53:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176110576] [2024-11-10 04:53:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176110576] [2024-11-10 04:53:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176110576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:53:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954351323] [2024-11-10 04:53:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:39,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:53:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:53:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:53:39,407 INFO L87 Difference]: Start difference. First operand 4986 states and 7675 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:53:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:39,958 INFO L93 Difference]: Finished difference Result 8584 states and 13187 transitions. [2024-11-10 04:53:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:53:39,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-11-10 04:53:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:39,983 INFO L225 Difference]: With dead ends: 8584 [2024-11-10 04:53:39,983 INFO L226 Difference]: Without dead ends: 5028 [2024-11-10 04:53:39,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:53:39,994 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 295 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:39,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 619 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:53:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2024-11-10 04:53:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 4986. [2024-11-10 04:53:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4986 states, 4525 states have (on average 1.5078453038674033) internal successors, (6823), 4557 states have internal predecessors, (6823), 416 states have call successors, (416), 44 states have call predecessors, (416), 44 states have return successors, (416), 384 states have call predecessors, (416), 416 states have call successors, (416) [2024-11-10 04:53:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 7655 transitions. [2024-11-10 04:53:40,361 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 7655 transitions. Word has length 166 [2024-11-10 04:53:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 4986 states and 7655 transitions. [2024-11-10 04:53:40,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:53:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 7655 transitions. [2024-11-10 04:53:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:53:40,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:40,369 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 04:53:40,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:40,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -264605380, now seen corresponding path program 1 times [2024-11-10 04:53:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:40,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836847459] [2024-11-10 04:53:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 04:53:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836847459] [2024-11-10 04:53:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836847459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:53:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89667711] [2024-11-10 04:53:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:41,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:41,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:53:41,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:53:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:41,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 04:53:41,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 742 proven. 108 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-10 04:53:43,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 04:53:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89667711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:53:43,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:53:43,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 8] total 28 [2024-11-10 04:53:43,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15796300] [2024-11-10 04:53:43,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:53:43,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 04:53:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:43,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 04:53:43,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-11-10 04:53:43,774 INFO L87 Difference]: Start difference. First operand 4986 states and 7655 transitions. Second operand has 28 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 10 states have call successors, (56), 5 states have call predecessors, (56), 9 states have return successors, (57), 9 states have call predecessors, (57), 10 states have call successors, (57) [2024-11-10 04:53:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:48,962 INFO L93 Difference]: Finished difference Result 13629 states and 20303 transitions. [2024-11-10 04:53:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-10 04:53:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 10 states have call successors, (56), 5 states have call predecessors, (56), 9 states have return successors, (57), 9 states have call predecessors, (57), 10 states have call successors, (57) Word has length 166 [2024-11-10 04:53:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:49,018 INFO L225 Difference]: With dead ends: 13629 [2024-11-10 04:53:49,019 INFO L226 Difference]: Without dead ends: 8646 [2024-11-10 04:53:49,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2439, Invalid=7263, Unknown=0, NotChecked=0, Total=9702 [2024-11-10 04:53:49,034 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1609 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:49,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 926 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 04:53:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2024-11-10 04:53:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 4954. [2024-11-10 04:53:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4954 states, 4483 states have (on average 1.4831585991523533) internal successors, (6649), 4511 states have internal predecessors, (6649), 372 states have call successors, (372), 98 states have call predecessors, (372), 98 states have return successors, (372), 344 states have call predecessors, (372), 372 states have call successors, (372) [2024-11-10 04:53:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 7393 transitions. [2024-11-10 04:53:49,406 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 7393 transitions. Word has length 166 [2024-11-10 04:53:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:49,407 INFO L471 AbstractCegarLoop]: Abstraction has 4954 states and 7393 transitions. [2024-11-10 04:53:49,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 10 states have call successors, (56), 5 states have call predecessors, (56), 9 states have return successors, (57), 9 states have call predecessors, (57), 10 states have call successors, (57) [2024-11-10 04:53:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 7393 transitions. [2024-11-10 04:53:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 04:53:49,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:49,412 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:49,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:53:49,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 04:53:49,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash -880364063, now seen corresponding path program 1 times [2024-11-10 04:53:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548149117] [2024-11-10 04:53:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 75 proven. 51 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-10 04:53:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548149117] [2024-11-10 04:53:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548149117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:53:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006775179] [2024-11-10 04:53:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:50,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:50,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:50,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:53:50,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:53:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:50,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 04:53:50,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 737 proven. 138 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-10 04:53:52,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-10 04:53:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006775179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:53:53,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:53:53,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 11] total 33 [2024-11-10 04:53:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265605192] [2024-11-10 04:53:53,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:53:53,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 04:53:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:53,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 04:53:53,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 04:53:53,470 INFO L87 Difference]: Start difference. First operand 4954 states and 7393 transitions. Second operand has 33 states, 33 states have (on average 4.545454545454546) internal successors, (150), 32 states have internal predecessors, (150), 10 states have call successors, (50), 6 states have call predecessors, (50), 12 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) [2024-11-10 04:53:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:58,588 INFO L93 Difference]: Finished difference Result 12731 states and 18539 transitions. [2024-11-10 04:53:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-10 04:53:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.545454545454546) internal successors, (150), 32 states have internal predecessors, (150), 10 states have call successors, (50), 6 states have call predecessors, (50), 12 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) Word has length 167 [2024-11-10 04:53:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:58,620 INFO L225 Difference]: With dead ends: 12731 [2024-11-10 04:53:58,621 INFO L226 Difference]: Without dead ends: 7780 [2024-11-10 04:53:58,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2024, Invalid=5286, Unknown=0, NotChecked=0, Total=7310 [2024-11-10 04:53:58,632 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 2266 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:58,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 1588 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 04:53:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2024-11-10 04:53:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 3084. [2024-11-10 04:53:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2675 states have (on average 1.422056074766355) internal successors, (3804), 2687 states have internal predecessors, (3804), 300 states have call successors, (300), 108 states have call predecessors, (300), 108 states have return successors, (300), 288 states have call predecessors, (300), 300 states have call successors, (300) [2024-11-10 04:53:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4404 transitions. [2024-11-10 04:53:58,925 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4404 transitions. Word has length 167 [2024-11-10 04:53:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:58,926 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 4404 transitions. [2024-11-10 04:53:58,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.545454545454546) internal successors, (150), 32 states have internal predecessors, (150), 10 states have call successors, (50), 6 states have call predecessors, (50), 12 states have return successors, (52), 10 states have call predecessors, (52), 10 states have call successors, (52) [2024-11-10 04:53:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4404 transitions. [2024-11-10 04:53:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 04:53:58,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:58,937 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:58,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:53:59,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 04:53:59,143 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1708045855, now seen corresponding path program 1 times [2024-11-10 04:53:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810213589] [2024-11-10 04:53:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:53:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:53:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:53:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:53:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:53:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:53:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:53:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:53:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:53:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:53:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:53:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:53:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:53:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:53:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:53:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:53:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:53:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:53:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:53:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810213589] [2024-11-10 04:53:59,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810213589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:59,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:59,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:53:59,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637191789] [2024-11-10 04:53:59,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:59,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:53:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:53:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:53:59,481 INFO L87 Difference]: Start difference. First operand 3084 states and 4404 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:53:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:59,980 INFO L93 Difference]: Finished difference Result 6176 states and 8817 transitions. [2024-11-10 04:53:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:53:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-11-10 04:53:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:59,991 INFO L225 Difference]: With dead ends: 6176 [2024-11-10 04:53:59,991 INFO L226 Difference]: Without dead ends: 3095 [2024-11-10 04:53:59,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:53:59,996 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:59,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 464 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:53:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2024-11-10 04:54:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3088. [2024-11-10 04:54:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 2679 states have (on average 1.41993281075028) internal successors, (3804), 2691 states have internal predecessors, (3804), 300 states have call successors, (300), 108 states have call predecessors, (300), 108 states have return successors, (300), 288 states have call predecessors, (300), 300 states have call successors, (300) [2024-11-10 04:54:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4404 transitions. [2024-11-10 04:54:00,245 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4404 transitions. Word has length 168 [2024-11-10 04:54:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:00,245 INFO L471 AbstractCegarLoop]: Abstraction has 3088 states and 4404 transitions. [2024-11-10 04:54:00,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:54:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4404 transitions. [2024-11-10 04:54:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 04:54:00,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:00,249 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:00,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 04:54:00,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:00,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1051032644, now seen corresponding path program 1 times [2024-11-10 04:54:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930780775] [2024-11-10 04:54:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:54:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:54:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:54:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:54:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:54:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:54:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:54:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:54:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:54:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930780775] [2024-11-10 04:54:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930780775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:00,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:00,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 04:54:00,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945889271] [2024-11-10 04:54:00,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:00,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:54:00,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:00,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:54:00,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:54:00,703 INFO L87 Difference]: Start difference. First operand 3088 states and 4404 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:54:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:01,468 INFO L93 Difference]: Finished difference Result 6180 states and 8811 transitions. [2024-11-10 04:54:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:54:01,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 168 [2024-11-10 04:54:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:01,482 INFO L225 Difference]: With dead ends: 6180 [2024-11-10 04:54:01,482 INFO L226 Difference]: Without dead ends: 3095 [2024-11-10 04:54:01,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:54:01,490 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 268 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:01,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 629 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:54:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2024-11-10 04:54:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3084. [2024-11-10 04:54:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2675 states have (on average 1.4190654205607476) internal successors, (3796), 2687 states have internal predecessors, (3796), 300 states have call successors, (300), 108 states have call predecessors, (300), 108 states have return successors, (300), 288 states have call predecessors, (300), 300 states have call successors, (300) [2024-11-10 04:54:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4396 transitions. [2024-11-10 04:54:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4396 transitions. Word has length 168 [2024-11-10 04:54:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:01,778 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 4396 transitions. [2024-11-10 04:54:01,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:54:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4396 transitions. [2024-11-10 04:54:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:54:01,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:01,783 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 04:54:01,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -419782620, now seen corresponding path program 1 times [2024-11-10 04:54:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141958844] [2024-11-10 04:54:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:54:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:54:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:54:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:54:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:54:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:54:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:54:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:54:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:54:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:54:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:54:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141958844] [2024-11-10 04:54:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141958844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 04:54:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699575187] [2024-11-10 04:54:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:54:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:54:02,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:54:02,373 INFO L87 Difference]: Start difference. First operand 3084 states and 4396 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:54:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:02,919 INFO L93 Difference]: Finished difference Result 7453 states and 10767 transitions. [2024-11-10 04:54:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:54:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 169 [2024-11-10 04:54:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:02,937 INFO L225 Difference]: With dead ends: 7453 [2024-11-10 04:54:02,938 INFO L226 Difference]: Without dead ends: 5766 [2024-11-10 04:54:02,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:54:02,943 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 192 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:02,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 632 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:54:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2024-11-10 04:54:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 3994. [2024-11-10 04:54:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3585 states have (on average 1.4382147838214785) internal successors, (5156), 3597 states have internal predecessors, (5156), 300 states have call successors, (300), 108 states have call predecessors, (300), 108 states have return successors, (300), 288 states have call predecessors, (300), 300 states have call successors, (300) [2024-11-10 04:54:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5756 transitions. [2024-11-10 04:54:03,202 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 5756 transitions. Word has length 169 [2024-11-10 04:54:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:03,202 INFO L471 AbstractCegarLoop]: Abstraction has 3994 states and 5756 transitions. [2024-11-10 04:54:03,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:54:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 5756 transitions. [2024-11-10 04:54:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 04:54:03,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:03,206 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 04:54:03,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:03,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 827764325, now seen corresponding path program 1 times [2024-11-10 04:54:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400506500] [2024-11-10 04:54:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:54:03,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168165564] [2024-11-10 04:54:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:03,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:03,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:03,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:54:03,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 04:54:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:54:03,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:54:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:54:03,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:54:03,946 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:54:03,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:54:03,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:54:04,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:04,154 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:04,279 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:54:04,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:54:04 BoogieIcfgContainer [2024-11-10 04:54:04,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:54:04,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:54:04,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:54:04,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:54:04,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:31" (3/4) ... [2024-11-10 04:54:04,286 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:54:04,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:54:04,287 INFO L158 Benchmark]: Toolchain (without parser) took 34568.19ms. Allocated memory was 127.9MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 70.9MB in the beginning and 645.5MB in the end (delta: -574.6MB). Peak memory consumption was 374.6MB. Max. memory is 16.1GB. [2024-11-10 04:54:04,288 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 127.9MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:54:04,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.18ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 70.6MB in the beginning and 130.2MB in the end (delta: -59.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-10 04:54:04,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.02ms. Allocated memory is still 165.7MB. Free memory was 130.2MB in the beginning and 124.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:54:04,289 INFO L158 Benchmark]: Boogie Preprocessor took 82.15ms. Allocated memory is still 165.7MB. Free memory was 124.7MB in the beginning and 118.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 04:54:04,289 INFO L158 Benchmark]: IcfgBuilder took 773.41ms. Allocated memory is still 165.7MB. Free memory was 118.7MB in the beginning and 84.9MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 04:54:04,290 INFO L158 Benchmark]: TraceAbstraction took 33201.68ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 84.0MB in the beginning and 646.5MB in the end (delta: -562.5MB). Peak memory consumption was 347.5MB. Max. memory is 16.1GB. [2024-11-10 04:54:04,290 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 1.1GB. Free memory was 646.5MB in the beginning and 645.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:54:04,294 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.21ms. Allocated memory is still 127.9MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.18ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 70.6MB in the beginning and 130.2MB in the end (delta: -59.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.02ms. Allocated memory is still 165.7MB. Free memory was 130.2MB in the beginning and 124.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.15ms. Allocated memory is still 165.7MB. Free memory was 124.7MB in the beginning and 118.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 773.41ms. Allocated memory is still 165.7MB. Free memory was 118.7MB in the beginning and 84.9MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33201.68ms. Allocated memory was 165.7MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 84.0MB in the beginning and 646.5MB in the end (delta: -562.5MB). Peak memory consumption was 347.5MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 1.1GB. Free memory was 646.5MB in the beginning and 645.5MB in the end (delta: 1.0MB). 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 175, overapproximation of bitwiseOr at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] signed short int var_1_28 = 256; [L39] signed long int var_1_30 = -4; [L40] double var_1_32 = 0.0; [L41] unsigned short int var_1_34 = 34858; [L42] unsigned short int var_1_35 = 41225; [L43] double var_1_37 = 63.63; [L44] signed char var_1_39 = 10; [L45] signed char var_1_40 = -25; [L46] signed char var_1_41 = 4; [L47] unsigned char var_1_42 = 50; [L48] unsigned long int last_1_var_1_10 = 256; [L49] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] CALL updateLastVariables() [L171] last_1_var_1_10 = var_1_10 [L172] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L182] RET updateLastVariables() [L183] CALL updateVariables() [L134] var_1_3 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L137] var_1_5 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L138] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L139] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L139] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L140] var_1_13 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L141] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L142] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L142] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L143] var_1_14 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L144] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L145] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L146] var_1_15 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L147] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L148] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L149] var_1_16 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L151] var_1_21 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L152] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L153] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L154] var_1_22 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L155] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L156] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L156] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L157] var_1_34 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L159] CALL assume_abort_if_not(var_1_34 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L159] RET assume_abort_if_not(var_1_34 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L160] var_1_35 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_35 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L161] RET assume_abort_if_not(var_1_35 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L162] CALL assume_abort_if_not(var_1_35 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L162] RET assume_abort_if_not(var_1_35 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L163] var_1_40 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L164] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L165] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L165] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_5=3, var_1_6=256] [L166] var_1_41 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_41 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L167] RET assume_abort_if_not(var_1_41 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L168] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L168] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L183] RET updateVariables() [L184] CALL step() [L53] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L58] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=258, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L59] COND TRUE stepLocal_2 > last_1_var_1_10 [L60] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L62] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L63] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L67] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=86, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L68] COND FALSE !(stepLocal_1 || var_1_3) [L73] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L75] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L86] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L91] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L91] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L92] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L97] COND TRUE var_1_20 >= ((((var_1_14) > (var_1_23)) ? (var_1_14) : (var_1_23))) [L98] var_1_24 = ((((((((var_1_23) > (var_1_20)) ? (var_1_23) : (var_1_20)))) < (var_1_14)) ? (((((var_1_23) > (var_1_20)) ? (var_1_23) : (var_1_20)))) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L102] var_1_28 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L103] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L103] COND TRUE ((var_1_6 ^ var_1_20) % var_1_21) > -10 [L104] var_1_30 = ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L106] EXPR ((((var_1_22) > (-16)) ? (var_1_22) : (-16))) & 16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L106] COND TRUE (~ var_1_5) <= (((((var_1_22) > (-16)) ? (var_1_22) : (-16))) & 16) [L107] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L115] EXPR var_1_35 & var_1_14 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L115] EXPR (var_1_35 & var_1_14) >> var_1_22 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L115] COND TRUE var_1_20 >= ((var_1_35 & var_1_14) >> var_1_22) [L116] var_1_37 = ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L118] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L119] COND FALSE !(var_1_22 > var_1_21) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L175-L176] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=86, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=384, var_1_22=256, var_1_23=64, var_1_24=0, var_1_28=128, var_1_30=128, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_5=3, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.0s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6226 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6214 mSDsluCounter, 8212 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5550 mSDsCounter, 1307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6057 IncrementalHoareTripleChecker+Invalid, 7364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1307 mSolverCounterUnsat, 2662 mSDtfsCounter, 6057 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1572 GetRequests, 1340 SyntacticMatches, 3 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4894 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4986occurred in iteration=8, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 11471 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 2985 NumberOfCodeBlocks, 2985 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2962 ConstructedInterpolants, 0 QuantifiedInterpolants, 16948 SizeOfPredicates, 9 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 17817/18216 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:54:04,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.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 c576a24d45ab301447d14f0f509fbb4fda0d590a05a36555d57f7b59c4fd472a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:54:06,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:54:06,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:54:06,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:54:06,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:54:06,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:54:06,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:54:06,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:54:06,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:54:06,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:54:06,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:54:06,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:54:06,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:54:06,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:54:06,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:54:06,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:54:06,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:54:06,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:54:06,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:54:06,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:54:06,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:54:06,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:54:06,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:54:06,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:54:06,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:54:06,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:54:06,708 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:54:06,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:54:06,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:54:06,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:54:06,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:54:06,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:54:06,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:54:06,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:54:06,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:06,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:54:06,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:54:06,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:54:06,711 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:54:06,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:54:06,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:54:06,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:54:06,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:54:06,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:54:06,713 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 -> c576a24d45ab301447d14f0f509fbb4fda0d590a05a36555d57f7b59c4fd472a [2024-11-10 04:54:07,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:54:07,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:54:07,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:54:07,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:54:07,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:54:07,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i [2024-11-10 04:54:08,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:54:08,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:54:08,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i [2024-11-10 04:54:08,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a369dea92/0ae00b25c15f448691ed7d83c3dd8825/FLAG046b6aac2 [2024-11-10 04:54:08,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a369dea92/0ae00b25c15f448691ed7d83c3dd8825 [2024-11-10 04:54:08,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:54:08,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:54:08,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:08,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:54:08,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:54:08,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:08" (1/1) ... [2024-11-10 04:54:08,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ba7ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:08, skipping insertion in model container [2024-11-10 04:54:08,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:08" (1/1) ... [2024-11-10 04:54:08,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:54:09,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i[918,931] [2024-11-10 04:54:09,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:09,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:54:09,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i[918,931] [2024-11-10 04:54:09,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:09,387 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:54:09,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09 WrapperNode [2024-11-10 04:54:09,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:09,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:09,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:54:09,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:54:09,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,449 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-10 04:54:09,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:09,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:54:09,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:54:09,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:54:09,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:54:09,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:54:09,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:54:09,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:54:09,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:54:09,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (1/1) ... [2024-11-10 04:54:09,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:09,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:54:09,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:54:09,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:54:09,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:54:09,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:54:09,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:54:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:54:09,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:54:09,719 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:54:09,722 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:54:26,193 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:54:26,194 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:54:26,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:54:26,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:54:26,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:26 BoogieIcfgContainer [2024-11-10 04:54:26,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:54:26,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:54:26,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:54:26,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:54:26,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:54:08" (1/3) ... [2024-11-10 04:54:26,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3dfd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:26, skipping insertion in model container [2024-11-10 04:54:26,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:09" (2/3) ... [2024-11-10 04:54:26,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3dfd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:26, skipping insertion in model container [2024-11-10 04:54:26,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:26" (3/3) ... [2024-11-10 04:54:26,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-3.i [2024-11-10 04:54:26,247 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:54:26,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:54:26,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:54:26,318 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;@5d1a3292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:54:26,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:54:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 04:54:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 04:54:26,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:26,345 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:26,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:26,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -990366739, now seen corresponding path program 1 times [2024-11-10 04:54:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:54:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729250291] [2024-11-10 04:54:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:54:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:54:26,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:54:26,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:54:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:27,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:54:27,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-10 04:54:27,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:54:27,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:54:27,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729250291] [2024-11-10 04:54:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729250291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:27,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:54:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752761250] [2024-11-10 04:54:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:27,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:54:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:54:27,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:54:27,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:27,508 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:54:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:27,547 INFO L93 Difference]: Finished difference Result 164 states and 286 transitions. [2024-11-10 04:54:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:54:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-10 04:54:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:27,560 INFO L225 Difference]: With dead ends: 164 [2024-11-10 04:54:27,560 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 04:54:27,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:27,568 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:27,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:54:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 04:54:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-10 04:54:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 04:54:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2024-11-10 04:54:27,612 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 155 [2024-11-10 04:54:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:27,612 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2024-11-10 04:54:27,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 04:54:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2024-11-10 04:54:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 04:54:27,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:27,622 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:27,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 04:54:27,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:54:27,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1980277420, now seen corresponding path program 1 times [2024-11-10 04:54:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:54:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718730255] [2024-11-10 04:54:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:27,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:54:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:54:27,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:54:27,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:54:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:28,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:54:28,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 04:54:33,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:54:33,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:54:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718730255] [2024-11-10 04:54:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718730255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:54:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985984248] [2024-11-10 04:54:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:54:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:54:33,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:54:33,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:54:33,191 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 04:54:37,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:54:39,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []