./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.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_floatingpointinfluence_has-floats_file-56.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 ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:44:03,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:44:03,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:44:03,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:44:03,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:44:03,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:44:03,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:44:03,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:44:03,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:44:03,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:44:03,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:44:03,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:44:03,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:44:03,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:44:03,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:44:03,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:44:03,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:44:03,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:44:03,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:44:03,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:44:03,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:44:03,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:44:03,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:44:03,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:44:03,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:44:03,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:44:03,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:44:03,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:44:03,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:44:03,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:44:03,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:44:03,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:44:03,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:44:03,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:44:03,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:44:03,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:44:03,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:44:03,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:44:03,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:44:03,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:44:03,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:44:03,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:44:03,805 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 -> ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c [2024-11-10 06:44:03,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:44:04,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:44:04,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:44:04,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:44:04,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:44:04,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2024-11-10 06:44:05,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:44:05,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:44:05,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2024-11-10 06:44:05,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6344d7f7/7a5b208c796742c0b105db24ab9e9dce/FLAG1a6392e46 [2024-11-10 06:44:05,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6344d7f7/7a5b208c796742c0b105db24ab9e9dce [2024-11-10 06:44:05,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:44:05,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:44:05,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:44:05,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:44:05,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:44:05,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:44:05" (1/1) ... [2024-11-10 06:44:05,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47572136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:05, skipping insertion in model container [2024-11-10 06:44:05,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:44:05" (1/1) ... [2024-11-10 06:44:05,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:44:06,116 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_floatingpointinfluence_has-floats_file-56.i[917,930] [2024-11-10 06:44:06,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:44:06,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:44:06,219 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_floatingpointinfluence_has-floats_file-56.i[917,930] [2024-11-10 06:44:06,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:44:06,301 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:44:06,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06 WrapperNode [2024-11-10 06:44:06,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:44:06,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:44:06,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:44:06,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:44:06,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,375 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-10 06:44:06,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:44:06,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:44:06,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:44:06,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:44:06,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,417 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 06:44:06,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:44:06,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:44:06,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:44:06,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:44:06,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (1/1) ... [2024-11-10 06:44:06,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:44:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:44:06,503 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 06:44:06,514 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 06:44:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:44:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:44:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:44:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:44:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:44:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:44:06,642 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:44:06,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:44:07,241 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2024-11-10 06:44:07,272 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:44:07,273 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:44:07,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:44:07,301 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:44:07,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:07 BoogieIcfgContainer [2024-11-10 06:44:07,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:44:07,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:44:07,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:44:07,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:44:07,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:44:05" (1/3) ... [2024-11-10 06:44:07,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ea0565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:44:07, skipping insertion in model container [2024-11-10 06:44:07,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:06" (2/3) ... [2024-11-10 06:44:07,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ea0565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:44:07, skipping insertion in model container [2024-11-10 06:44:07,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:07" (3/3) ... [2024-11-10 06:44:07,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-56.i [2024-11-10 06:44:07,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:44:07,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:44:07,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:44:07,409 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;@736e3285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:44:07,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:44:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 06:44:07,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:07,435 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:07,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1765106213, now seen corresponding path program 1 times [2024-11-10 06:44:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652693538] [2024-11-10 06:44:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:07,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:07,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652693538] [2024-11-10 06:44:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652693538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:44:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371647706] [2024-11-10 06:44:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:07,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:44:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:44:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:44:07,996 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:44:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:08,053 INFO L93 Difference]: Finished difference Result 140 states and 230 transitions. [2024-11-10 06:44:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:44:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-10 06:44:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:08,066 INFO L225 Difference]: With dead ends: 140 [2024-11-10 06:44:08,067 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 06:44:08,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 06:44:08,077 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:08,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 06:44:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 06:44:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2024-11-10 06:44:08,124 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 126 [2024-11-10 06:44:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:08,125 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2024-11-10 06:44:08,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:44:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2024-11-10 06:44:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 06:44:08,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:08,129 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:44:08,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash -976006788, now seen corresponding path program 1 times [2024-11-10 06:44:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:08,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957868077] [2024-11-10 06:44:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:22,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957868077] [2024-11-10 06:44:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957868077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:22,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:44:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229887914] [2024-11-10 06:44:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:44:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:44:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:44:22,477 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:22,889 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2024-11-10 06:44:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:44:22,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-10 06:44:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:22,892 INFO L225 Difference]: With dead ends: 187 [2024-11-10 06:44:22,892 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 06:44:22,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:44:22,894 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 82 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:22,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 320 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:44:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 06:44:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2024-11-10 06:44:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-11-10 06:44:22,909 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 126 [2024-11-10 06:44:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:22,910 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-11-10 06:44:22,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-11-10 06:44:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 06:44:22,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:22,915 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:22,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:44:22,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:22,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1481565413, now seen corresponding path program 1 times [2024-11-10 06:44:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:22,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338296098] [2024-11-10 06:44:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338296098] [2024-11-10 06:44:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338296098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:23,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:44:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086805473] [2024-11-10 06:44:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:23,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:44:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:44:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:44:23,072 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:23,109 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2024-11-10 06:44:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:44:23,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-10 06:44:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:23,112 INFO L225 Difference]: With dead ends: 162 [2024-11-10 06:44:23,112 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 06:44:23,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 06:44:23,117 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:23,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 06:44:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 06:44:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-11-10 06:44:23,138 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 126 [2024-11-10 06:44:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:23,140 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-11-10 06:44:23,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-11-10 06:44:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 06:44:23,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:23,143 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:23,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:44:23,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:23,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1582483501, now seen corresponding path program 1 times [2024-11-10 06:44:23,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499400378] [2024-11-10 06:44:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:23,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499400378] [2024-11-10 06:44:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499400378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:44:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327903819] [2024-11-10 06:44:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:23,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:44:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:44:23,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:44:23,325 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:23,382 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2024-11-10 06:44:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:44:23,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 127 [2024-11-10 06:44:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:23,386 INFO L225 Difference]: With dead ends: 193 [2024-11-10 06:44:23,388 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 06:44:23,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 06:44:23,394 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:23,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 06:44:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-11-10 06:44:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-11-10 06:44:23,414 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 127 [2024-11-10 06:44:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:23,414 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-11-10 06:44:23,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-11-10 06:44:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 06:44:23,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:23,420 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:23,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:44:23,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:23,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1840685268, now seen corresponding path program 1 times [2024-11-10 06:44:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180862131] [2024-11-10 06:44:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180862131] [2024-11-10 06:44:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180862131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:44:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251208305] [2024-11-10 06:44:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:23,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:44:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:23,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:44:23,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:44:23,582 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:23,634 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2024-11-10 06:44:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:44:23,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 127 [2024-11-10 06:44:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:23,637 INFO L225 Difference]: With dead ends: 207 [2024-11-10 06:44:23,638 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 06:44:23,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 06:44:23,640 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:23,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 207 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 06:44:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2024-11-10 06:44:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-11-10 06:44:23,652 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 127 [2024-11-10 06:44:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-11-10 06:44:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-11-10 06:44:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:44:23,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:23,656 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:23,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:44:23,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:23,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash 544073694, now seen corresponding path program 1 times [2024-11-10 06:44:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473498633] [2024-11-10 06:44:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473498633] [2024-11-10 06:44:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473498633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 06:44:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386175399] [2024-11-10 06:44:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:38,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:44:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:44:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:44:38,876 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:39,847 INFO L93 Difference]: Finished difference Result 344 states and 487 transitions. [2024-11-10 06:44:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 06:44:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-10 06:44:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:39,850 INFO L225 Difference]: With dead ends: 344 [2024-11-10 06:44:39,850 INFO L226 Difference]: Without dead ends: 261 [2024-11-10 06:44:39,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-10 06:44:39,851 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 353 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:39,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 638 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:44:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-10 06:44:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 185. [2024-11-10 06:44:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 144 states have internal predecessors, (195), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 06:44:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2024-11-10 06:44:39,878 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 128 [2024-11-10 06:44:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:39,878 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2024-11-10 06:44:39,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2024-11-10 06:44:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:44:39,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:39,882 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:39,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:44:39,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1345678845, now seen corresponding path program 1 times [2024-11-10 06:44:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491528790] [2024-11-10 06:44:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491528790] [2024-11-10 06:44:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491528790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:40,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:44:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510257347] [2024-11-10 06:44:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:44:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:44:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:44:40,281 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:40,515 INFO L93 Difference]: Finished difference Result 329 states and 468 transitions. [2024-11-10 06:44:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:44:40,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-10 06:44:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:40,524 INFO L225 Difference]: With dead ends: 329 [2024-11-10 06:44:40,524 INFO L226 Difference]: Without dead ends: 326 [2024-11-10 06:44:40,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:44:40,528 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 72 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:40,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 578 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:44:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-10 06:44:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2024-11-10 06:44:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 248 states have (on average 1.3064516129032258) internal successors, (324), 250 states have internal predecessors, (324), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 06:44:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 460 transitions. [2024-11-10 06:44:40,575 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 460 transitions. Word has length 128 [2024-11-10 06:44:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:40,576 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 460 transitions. [2024-11-10 06:44:40,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 460 transitions. [2024-11-10 06:44:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:44:40,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:40,578 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:44:40,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2051625503, now seen corresponding path program 1 times [2024-11-10 06:44:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979077794] [2024-11-10 06:44:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979077794] [2024-11-10 06:44:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979077794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:44:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082362583] [2024-11-10 06:44:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:50,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:44:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:44:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:44:50,735 INFO L87 Difference]: Start difference. First operand 321 states and 460 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:51,257 INFO L93 Difference]: Finished difference Result 863 states and 1201 transitions. [2024-11-10 06:44:51,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:44:51,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-10 06:44:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:51,263 INFO L225 Difference]: With dead ends: 863 [2024-11-10 06:44:51,263 INFO L226 Difference]: Without dead ends: 545 [2024-11-10 06:44:51,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:44:51,265 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:51,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 389 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:44:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-10 06:44:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 345. [2024-11-10 06:44:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 272 states have (on average 1.3161764705882353) internal successors, (358), 274 states have internal predecessors, (358), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 06:44:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 494 transitions. [2024-11-10 06:44:51,311 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 494 transitions. Word has length 128 [2024-11-10 06:44:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:51,311 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 494 transitions. [2024-11-10 06:44:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 494 transitions. [2024-11-10 06:44:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:44:51,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:51,317 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:51,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:44:51,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:51,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2046828288, now seen corresponding path program 1 times [2024-11-10 06:44:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078424496] [2024-11-10 06:44:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 06:44:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078424496] [2024-11-10 06:44:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078424496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:44:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527775653] [2024-11-10 06:44:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:51,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:44:51,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:44:51,755 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 06:44:51,757 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 06:44:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:51,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:44:51,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:44:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-10 06:44:52,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:44:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 06:44:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527775653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:44:52,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:44:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 06:44:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076232972] [2024-11-10 06:44:52,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:44:52,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:44:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:44:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:44:52,435 INFO L87 Difference]: Start difference. First operand 345 states and 494 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:44:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:52,904 INFO L93 Difference]: Finished difference Result 871 states and 1238 transitions. [2024-11-10 06:44:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 06:44:52,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 128 [2024-11-10 06:44:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:52,910 INFO L225 Difference]: With dead ends: 871 [2024-11-10 06:44:52,910 INFO L226 Difference]: Without dead ends: 529 [2024-11-10 06:44:52,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-10 06:44:52,914 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 179 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:52,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 231 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:44:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-10 06:44:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 331. [2024-11-10 06:44:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 256 states have (on average 1.27734375) internal successors, (327), 258 states have internal predecessors, (327), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 06:44:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2024-11-10 06:44:52,961 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 128 [2024-11-10 06:44:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:52,963 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2024-11-10 06:44:52,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:44:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2024-11-10 06:44:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:44:52,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:52,968 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:52,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:44:53,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:44:53,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:53,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash 169702882, now seen corresponding path program 1 times [2024-11-10 06:44:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104917006] [2024-11-10 06:44:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:44:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:44:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:44:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:44:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:44:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:44:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:44:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:44:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:44:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:44:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:44:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:44:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:44:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104917006] [2024-11-10 06:44:53,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104917006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:53,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:44:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825704226] [2024-11-10 06:44:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:53,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:44:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:44:53,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:44:53,336 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:53,406 INFO L93 Difference]: Finished difference Result 641 states and 893 transitions. [2024-11-10 06:44:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:44:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-10 06:44:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:53,410 INFO L225 Difference]: With dead ends: 641 [2024-11-10 06:44:53,417 INFO L226 Difference]: Without dead ends: 313 [2024-11-10 06:44:53,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 06:44:53,419 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:53,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-10 06:44:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-10 06:44:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 238 states have (on average 1.2394957983193278) internal successors, (295), 240 states have internal predecessors, (295), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 06:44:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 431 transitions. [2024-11-10 06:44:53,478 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 431 transitions. Word has length 128 [2024-11-10 06:44:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:53,483 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 431 transitions. [2024-11-10 06:44:53,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 431 transitions. [2024-11-10 06:44:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 06:44:53,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:53,486 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:53,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 06:44:53,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1677254691, now seen corresponding path program 1 times [2024-11-10 06:44:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031786440] [2024-11-10 06:44:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:45:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:45:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:45:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:45:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:45:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:45:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:45:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:45:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:45:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:45:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:45:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:45:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:45:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:45:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:45:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:45:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:45:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:45:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:45:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:45:02,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:45:02,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031786440] [2024-11-10 06:45:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031786440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:02,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:02,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:45:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257984966] [2024-11-10 06:45:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:02,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:45:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:45:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:45:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:45:02,551 INFO L87 Difference]: Start difference. First operand 313 states and 431 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:03,217 INFO L93 Difference]: Finished difference Result 715 states and 966 transitions. [2024-11-10 06:45:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:45:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-10 06:45:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:03,225 INFO L225 Difference]: With dead ends: 715 [2024-11-10 06:45:03,227 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 06:45:03,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:45:03,231 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 71 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:03,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 364 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:45:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 06:45:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 319. [2024-11-10 06:45:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 244 states have (on average 1.2254098360655739) internal successors, (299), 246 states have internal predecessors, (299), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 06:45:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 435 transitions. [2024-11-10 06:45:03,284 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 435 transitions. Word has length 128 [2024-11-10 06:45:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:03,285 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 435 transitions. [2024-11-10 06:45:03,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 435 transitions. [2024-11-10 06:45:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 06:45:03,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:03,287 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:03,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 06:45:03,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:03,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1134781917, now seen corresponding path program 1 times [2024-11-10 06:45:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:45:03,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511103033] [2024-11-10 06:45:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:03,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:45:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:45:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:45:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:45:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:45:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:45:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:45:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:45:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:45:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:45:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:45:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:45:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:45:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:45:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:45:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:45:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:45:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:45:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:45:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:45:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:45:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:45:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511103033] [2024-11-10 06:45:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511103033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:45:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134431291] [2024-11-10 06:45:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:03,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:45:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:45:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:45:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:45:03,473 INFO L87 Difference]: Start difference. First operand 319 states and 435 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:03,566 INFO L93 Difference]: Finished difference Result 772 states and 1045 transitions. [2024-11-10 06:45:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:45:03,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2024-11-10 06:45:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:03,571 INFO L225 Difference]: With dead ends: 772 [2024-11-10 06:45:03,574 INFO L226 Difference]: Without dead ends: 456 [2024-11-10 06:45:03,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 06:45:03,577 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 43 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:03,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 182 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:45:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-10 06:45:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 439. [2024-11-10 06:45:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 320 states have (on average 1.178125) internal successors, (377), 326 states have internal predecessors, (377), 108 states have call successors, (108), 10 states have call predecessors, (108), 10 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 06:45:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 593 transitions. [2024-11-10 06:45:03,664 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 593 transitions. Word has length 130 [2024-11-10 06:45:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 593 transitions. [2024-11-10 06:45:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 593 transitions. [2024-11-10 06:45:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 06:45:03,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:03,670 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 06:45:03,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1795591613, now seen corresponding path program 1 times [2024-11-10 06:45:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:45:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106306741] [2024-11-10 06:45:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:45:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:45:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:45:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:45:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:45:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:45:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:45:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:45:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:45:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:45:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:45:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:45:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:45:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:45:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:45:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:45:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:45:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:45:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:45:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:45:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:45:03,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:45:03,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106306741] [2024-11-10 06:45:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106306741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:03,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:03,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:45:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625493397] [2024-11-10 06:45:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:03,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:45:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:45:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:45:03,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:45:03,806 INFO L87 Difference]: Start difference. First operand 439 states and 593 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:03,882 INFO L93 Difference]: Finished difference Result 841 states and 1125 transitions. [2024-11-10 06:45:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:45:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2024-11-10 06:45:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:03,886 INFO L225 Difference]: With dead ends: 841 [2024-11-10 06:45:03,891 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 06:45:03,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 06:45:03,893 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:03,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 209 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:45:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 06:45:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 359. [2024-11-10 06:45:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 280 states have (on average 1.167857142857143) internal successors, (327), 282 states have internal predecessors, (327), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 06:45:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 463 transitions. [2024-11-10 06:45:03,959 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 463 transitions. Word has length 130 [2024-11-10 06:45:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:03,960 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 463 transitions. [2024-11-10 06:45:03,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 463 transitions. [2024-11-10 06:45:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 06:45:03,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:03,963 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:03,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 06:45:03,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:03,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1643984128, now seen corresponding path program 1 times [2024-11-10 06:45:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:45:03,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934418360] [2024-11-10 06:45:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:45:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:45:04,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:45:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:45:04,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:45:04,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:45:04,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:45:04,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 06:45:04,216 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:45:04,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:45:04,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:45:04 BoogieIcfgContainer [2024-11-10 06:45:04,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:45:04,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:45:04,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:45:04,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:45:04,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:07" (3/4) ... [2024-11-10 06:45:04,408 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:45:04,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:45:04,410 INFO L158 Benchmark]: Toolchain (without parser) took 58502.59ms. Allocated memory was 239.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 173.0MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. [2024-11-10 06:45:04,414 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:45:04,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.09ms. Allocated memory is still 239.1MB. Free memory was 172.7MB in the beginning and 157.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:45:04,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.92ms. Allocated memory is still 239.1MB. Free memory was 157.7MB in the beginning and 153.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:45:04,415 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 239.1MB. Free memory was 153.8MB in the beginning and 148.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:45:04,415 INFO L158 Benchmark]: IcfgBuilder took 866.00ms. Allocated memory is still 239.1MB. Free memory was 148.7MB in the beginning and 195.7MB in the end (delta: -47.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-10 06:45:04,416 INFO L158 Benchmark]: TraceAbstraction took 57095.70ms. Allocated memory was 239.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 194.7MB in the beginning and 1.2GB in the end (delta: -986.2MB). Peak memory consumption was 418.8MB. Max. memory is 16.1GB. [2024-11-10 06:45:04,416 INFO L158 Benchmark]: Witness Printer took 8.50ms. Allocated memory is still 1.6GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:45:04,417 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.14ms. Allocated memory is still 119.5MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.09ms. Allocated memory is still 239.1MB. Free memory was 172.7MB in the beginning and 157.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.92ms. Allocated memory is still 239.1MB. Free memory was 157.7MB in the beginning and 153.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 239.1MB. Free memory was 153.8MB in the beginning and 148.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 866.00ms. Allocated memory is still 239.1MB. Free memory was 148.7MB in the beginning and 195.7MB in the end (delta: -47.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 57095.70ms. Allocated memory was 239.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 194.7MB in the beginning and 1.2GB in the end (delta: -986.2MB). Peak memory consumption was 418.8MB. Max. memory is 16.1GB. * Witness Printer took 8.50ms. Allocated memory is still 1.6GB. Free memory is still 1.2GB. 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 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] double var_1_9 = 10.5; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] double var_1_13 = 99.25; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_8=8, var_1_9=21/2] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_8=8, var_1_9=21/2] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=21/2] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=8, var_1_9=21/2] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_9=21/2] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_9=21/2] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L94] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L97] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L97] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L99] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L40] COND TRUE (last_1_var_1_14 >> var_1_3) >= last_1_var_1_14 [L41] var_1_1 = ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L45] COND FALSE !((var_1_8 + var_1_1) >= var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L49] COND FALSE !(var_1_1 >= (var_1_8 << var_1_3)) [L56] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=-255, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L63] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=-255, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L64] COND TRUE stepLocal_0 || var_1_16 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=21/2] [L65] COND TRUE stepLocal_1 > var_1_6 [L66] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=133] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=133] [L106] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=133] [L106-L107] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=133] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=63, var_1_7=62, var_1_8=61, var_1_9=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.8s, OverallIterations: 14, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1001 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 984 mSDsluCounter, 3748 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2448 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1437 IncrementalHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 1300 mSDtfsCounter, 1437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 868 GetRequests, 795 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=12, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 710 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 50.7s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 7875 SizeOfPredicates, 2 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 10242/10260 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 06:45:04,532 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_floatingpointinfluence_has-floats_file-56.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 ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:45:06,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:45:06,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:45:06,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:45:06,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:45:06,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:45:06,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:45:06,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:45:06,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:45:06,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:45:06,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:45:06,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:45:06,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:45:06,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:45:06,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:45:06,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:45:06,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:45:06,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:45:06,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:45:06,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:45:06,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:45:06,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:45:06,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:45:06,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:45:06,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:45:06,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:45:06,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:45:06,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:45:06,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:45:06,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:45:06,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:45:06,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:45:06,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:45:06,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:45:06,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:45:06,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:45:06,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:45:06,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:45:06,928 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:45:06,929 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:45:06,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:45:06,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:45:06,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:45:06,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:45:06,930 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 -> ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c [2024-11-10 06:45:07,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:45:07,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:45:07,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:45:07,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:45:07,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:45:07,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2024-11-10 06:45:09,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:45:09,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:45:09,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2024-11-10 06:45:09,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d22456fb/dcbc0d0f444e4ce299896461bd3ddb6c/FLAGcf4c9052e [2024-11-10 06:45:09,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d22456fb/dcbc0d0f444e4ce299896461bd3ddb6c [2024-11-10 06:45:09,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:45:09,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:45:09,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:45:09,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:45:09,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:45:09,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:09" (1/1) ... [2024-11-10 06:45:09,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1266bb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:09, skipping insertion in model container [2024-11-10 06:45:09,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:09" (1/1) ... [2024-11-10 06:45:09,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:45:09,883 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_floatingpointinfluence_has-floats_file-56.i[917,930] [2024-11-10 06:45:09,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:45:09,954 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:45:09,981 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_floatingpointinfluence_has-floats_file-56.i[917,930] [2024-11-10 06:45:10,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:45:10,034 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:45:10,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10 WrapperNode [2024-11-10 06:45:10,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:45:10,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:45:10,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:45:10,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:45:10,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,082 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 06:45:10,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:45:10,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:45:10,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:45:10,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:45:10,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,154 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 06:45:10,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:45:10,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:45:10,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:45:10,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:45:10,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (1/1) ... [2024-11-10 06:45:10,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:45:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:45:10,215 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 06:45:10,223 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 06:45:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:45:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:45:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:45:10,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:45:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:45:10,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:45:10,331 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:45:10,335 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:45:10,542 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:45:10,543 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:45:10,555 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:45:10,557 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:45:10,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:10 BoogieIcfgContainer [2024-11-10 06:45:10,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:45:10,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:45:10,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:45:10,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:45:10,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:45:09" (1/3) ... [2024-11-10 06:45:10,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d00fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:10, skipping insertion in model container [2024-11-10 06:45:10,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:10" (2/3) ... [2024-11-10 06:45:10,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d00fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:10, skipping insertion in model container [2024-11-10 06:45:10,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:10" (3/3) ... [2024-11-10 06:45:10,568 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-56.i [2024-11-10 06:45:10,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:45:10,582 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:45:10,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:45:10,657 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;@404797e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:45:10,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:45:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:45:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 06:45:10,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:10,672 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:10,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash -91314479, now seen corresponding path program 1 times [2024-11-10 06:45:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:10,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561377815] [2024-11-10 06:45:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:10,692 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 06:45:10,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:10,699 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 06:45:10,706 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 06:45:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:10,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:45:10,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-10 06:45:10,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:45:10,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:45:10,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561377815] [2024-11-10 06:45:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561377815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:45:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278407891] [2024-11-10 06:45:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:10,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:45:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:45:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:45:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:45:10,941 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:45:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:10,961 INFO L93 Difference]: Finished difference Result 112 states and 190 transitions. [2024-11-10 06:45:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:45:10,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-11-10 06:45:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:10,969 INFO L225 Difference]: With dead ends: 112 [2024-11-10 06:45:10,969 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 06:45:10,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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 06:45:10,975 INFO L432 NwaCegarLoop]: 81 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, 81 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 06:45:10,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:45:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 06:45:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 06:45:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:45:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-10 06:45:11,010 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 121 [2024-11-10 06:45:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:11,010 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-10 06:45:11,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:45:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-11-10 06:45:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 06:45:11,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:11,013 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:45:11,019 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 06:45:11,214 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 06:45:11,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:11,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash 941257360, now seen corresponding path program 1 times [2024-11-10 06:45:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266983462] [2024-11-10 06:45:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:11,220 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 06:45:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:11,223 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 06:45:11,224 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 06:45:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:11,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 06:45:11,365 INFO L278 TraceCheckSpWp]: Computing forward predicates...