/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:35:54,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:35:54,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:35:54,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:35:54,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:35:54,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:35:54,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:35:54,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:35:54,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:35:54,421 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:35:54,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:35:54,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:35:54,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:35:54,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:35:54,423 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:35:54,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:35:54,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:35:54,424 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:35:54,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:35:54,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:35:54,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:35:54,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:35:54,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:35:54,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:35:54,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:35:54,426 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:35:54,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:35:54,426 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:35:54,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:35:54,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:35:54,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:35:54,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:35:54,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:35:54,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:35:54,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:35:54,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:35:54,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:35:54,430 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: Use bitabs translation -> false [2023-12-16 03:35:54,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:35:54,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:35:54,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:35:54,687 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:35:54,688 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:35:54,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-12-16 03:35:55,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:35:56,056 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:35:56,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-12-16 03:35:56,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5521b651f/52f186f992544778b0c13bcbeaad3302/FLAG0904263ec [2023-12-16 03:35:56,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5521b651f/52f186f992544778b0c13bcbeaad3302 [2023-12-16 03:35:56,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:35:56,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:35:56,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:35:56,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:35:56,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:35:56,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a45eefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56, skipping insertion in model container [2023-12-16 03:35:56,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:35:56,270 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-12-16 03:35:56,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:35:56,337 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:35:56,358 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-12-16 03:35:56,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:35:56,402 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:35:56,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56 WrapperNode [2023-12-16 03:35:56,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:35:56,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:35:56,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:35:56,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:35:56,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,450 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2023-12-16 03:35:56,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:35:56,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:35:56,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:35:56,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:35:56,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,493 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]. [2023-12-16 03:35:56,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:35:56,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:35:56,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:35:56,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:35:56,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (1/1) ... [2023-12-16 03:35:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:35:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:35:56,548 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) [2023-12-16 03:35:56,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:35:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:35:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:35:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:35:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:35:56,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:35:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:35:56,696 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:35:56,704 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:35:56,893 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:35:56,951 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:35:56,951 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:35:56,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:35:56 BoogieIcfgContainer [2023-12-16 03:35:56,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:35:56,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:35:56,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:35:56,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:35:56,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:35:56" (1/3) ... [2023-12-16 03:35:56,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac4a320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:35:56, skipping insertion in model container [2023-12-16 03:35:56,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:56" (2/3) ... [2023-12-16 03:35:56,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac4a320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:35:56, skipping insertion in model container [2023-12-16 03:35:56,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:35:56" (3/3) ... [2023-12-16 03:35:56,962 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2023-12-16 03:35:56,978 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:35:56,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:35:57,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:35:57,037 INFO L357 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, mHoare=true, 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;@13f80c0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:35:57,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:35:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:35:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 03:35:57,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:57,057 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:35:57,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:57,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash -381715089, now seen corresponding path program 1 times [2023-12-16 03:35:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633839651] [2023-12-16 03:35:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:35:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:35:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:35:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:35:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:35:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:35:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:35:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:35:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:35:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:57,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633839651] [2023-12-16 03:35:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633839651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:35:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712351006] [2023-12-16 03:35:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:57,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:35:57,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:35:57,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:35:57,450 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 03:35:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:57,520 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-12-16 03:35:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:35:57,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2023-12-16 03:35:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:57,531 INFO L225 Difference]: With dead ends: 95 [2023-12-16 03:35:57,531 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 03:35:57,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:35:57,540 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:35:57,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:35:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 03:35:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-16 03:35:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:35:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2023-12-16 03:35:57,585 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 109 [2023-12-16 03:35:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:57,586 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2023-12-16 03:35:57,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 03:35:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2023-12-16 03:35:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 03:35:57,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:57,589 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:35:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:35:57,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:57,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -755669969, now seen corresponding path program 1 times [2023-12-16 03:35:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871120380] [2023-12-16 03:35:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:35:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:35:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:35:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:35:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:35:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:35:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:35:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:35:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:35:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871120380] [2023-12-16 03:35:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871120380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:58,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:58,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:35:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805608046] [2023-12-16 03:35:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:58,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:35:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:58,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:35:58,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:35:58,116 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:35:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:58,270 INFO L93 Difference]: Finished difference Result 128 states and 195 transitions. [2023-12-16 03:35:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:35:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-12-16 03:35:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:58,273 INFO L225 Difference]: With dead ends: 128 [2023-12-16 03:35:58,273 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 03:35:58,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:35:58,275 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:35:58,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 238 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:35:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 03:35:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 47. [2023-12-16 03:35:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:35:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-12-16 03:35:58,289 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-12-16 03:35:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:58,290 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-12-16 03:35:58,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:35:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-12-16 03:35:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 03:35:58,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:58,292 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:35:58,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:35:58,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:58,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1960552136, now seen corresponding path program 1 times [2023-12-16 03:35:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:58,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157130801] [2023-12-16 03:35:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:36:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:36:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:36:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:36:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:36:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:36:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:36:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:36:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:36:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:36:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:36:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:36:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:36:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:36:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:36:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:36:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:36:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:36:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:36:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:36:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157130801] [2023-12-16 03:36:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157130801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:36:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:36:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:36:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439602078] [2023-12-16 03:36:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:36:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:36:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:36:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:36:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:36:00,733 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:36:00,949 INFO L93 Difference]: Finished difference Result 112 states and 163 transitions. [2023-12-16 03:36:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:36:00,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-12-16 03:36:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:36:00,951 INFO L225 Difference]: With dead ends: 112 [2023-12-16 03:36:00,951 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 03:36:00,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-12-16 03:36:00,953 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:36:00,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 226 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:36:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 03:36:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2023-12-16 03:36:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:36:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2023-12-16 03:36:00,968 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 110 [2023-12-16 03:36:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:36:00,969 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2023-12-16 03:36:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2023-12-16 03:36:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:36:00,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:36:00,975 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:36:00,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:36:00,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:36:00,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:36:00,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2088655939, now seen corresponding path program 1 times [2023-12-16 03:36:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:36:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320131220] [2023-12-16 03:36:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:36:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:36:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:36:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:36:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:36:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:36:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:36:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:36:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:36:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:36:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:36:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:36:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:36:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:36:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:36:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:36:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:36:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:36:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:36:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:36:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:36:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:36:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320131220] [2023-12-16 03:36:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320131220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:36:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:36:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:36:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908491668] [2023-12-16 03:36:01,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:36:01,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:36:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:36:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:36:01,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:36:01,055 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:36:01,083 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2023-12-16 03:36:01,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:36:01,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-16 03:36:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:36:01,086 INFO L225 Difference]: With dead ends: 121 [2023-12-16 03:36:01,086 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 03:36:01,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:36:01,088 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:36:01,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:36:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 03:36:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2023-12-16 03:36:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:36:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2023-12-16 03:36:01,094 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 111 [2023-12-16 03:36:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:36:01,094 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2023-12-16 03:36:01,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2023-12-16 03:36:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:36:01,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:36:01,096 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:36:01,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:36:01,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:36:01,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:36:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2088715521, now seen corresponding path program 1 times [2023-12-16 03:36:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:36:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651983446] [2023-12-16 03:36:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:36:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:36:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:36:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:36:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:36:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:36:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:36:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:36:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:36:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:36:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:36:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:36:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:36:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:36:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:36:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:36:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:36:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:36:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:36:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:36:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:36:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:36:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651983446] [2023-12-16 03:36:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651983446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:36:02,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:36:02,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 03:36:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918752524] [2023-12-16 03:36:02,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:36:02,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 03:36:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:36:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 03:36:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:36:02,678 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:36:02,850 INFO L93 Difference]: Finished difference Result 130 states and 176 transitions. [2023-12-16 03:36:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 03:36:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-16 03:36:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:36:02,852 INFO L225 Difference]: With dead ends: 130 [2023-12-16 03:36:02,852 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 03:36:02,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:36:02,854 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 29 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:36:02,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:36:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 03:36:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2023-12-16 03:36:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:36:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2023-12-16 03:36:02,860 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 111 [2023-12-16 03:36:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:36:02,860 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2023-12-16 03:36:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2023-12-16 03:36:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:36:02,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:36:02,861 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:36:02,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:36:02,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:36:02,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:36:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1408657151, now seen corresponding path program 1 times [2023-12-16 03:36:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:36:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886076174] [2023-12-16 03:36:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:36:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:36:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:36:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:36:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:36:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:36:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:36:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:36:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:36:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:36:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:36:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:36:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:36:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:36:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:36:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:36:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:36:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:36:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:36:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:36:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:36:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:36:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:36:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886076174] [2023-12-16 03:36:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886076174] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:36:04,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:36:04,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:36:04,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690797343] [2023-12-16 03:36:04,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:36:04,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:36:04,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:36:04,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:36:04,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:36:04,270 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:36:04,491 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2023-12-16 03:36:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:36:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-16 03:36:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:36:04,494 INFO L225 Difference]: With dead ends: 77 [2023-12-16 03:36:04,494 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 03:36:04,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-12-16 03:36:04,496 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:36:04,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:36:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 03:36:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2023-12-16 03:36:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:36:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2023-12-16 03:36:04,511 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 111 [2023-12-16 03:36:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:36:04,511 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2023-12-16 03:36:04,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 03:36:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2023-12-16 03:36:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 03:36:04,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:36:04,512 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:36:04,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:36:04,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:36:04,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:36:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash 312849302, now seen corresponding path program 1 times [2023-12-16 03:36:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:36:04,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323984541] [2023-12-16 03:36:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:36:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:36:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:36:04,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:36:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:36:04,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:36:04,639 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:36:04,640 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:36:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:36:04,644 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:36:04,647 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:36:04,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:36:04 BoogieIcfgContainer [2023-12-16 03:36:04,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:36:04,725 INFO L158 Benchmark]: Toolchain (without parser) took 8647.50ms. Allocated memory was 200.3MB in the beginning and 376.4MB in the end (delta: 176.2MB). Free memory was 140.9MB in the beginning and 145.9MB in the end (delta: -5.0MB). Peak memory consumption was 171.9MB. Max. memory is 8.0GB. [2023-12-16 03:36:04,726 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 200.3MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:36:04,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.72ms. Allocated memory is still 200.3MB. Free memory was 140.7MB in the beginning and 128.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:36:04,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.01ms. Allocated memory is still 200.3MB. Free memory was 128.0MB in the beginning and 125.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:36:04,726 INFO L158 Benchmark]: Boogie Preprocessor took 64.80ms. Allocated memory is still 200.3MB. Free memory was 125.2MB in the beginning and 121.3MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:36:04,726 INFO L158 Benchmark]: RCFGBuilder took 435.33ms. Allocated memory was 200.3MB in the beginning and 261.1MB in the end (delta: 60.8MB). Free memory was 121.0MB in the beginning and 212.1MB in the end (delta: -91.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2023-12-16 03:36:04,727 INFO L158 Benchmark]: TraceAbstraction took 7768.13ms. Allocated memory was 261.1MB in the beginning and 376.4MB in the end (delta: 115.3MB). Free memory was 211.6MB in the beginning and 145.9MB in the end (delta: 65.6MB). Peak memory consumption was 181.0MB. Max. memory is 8.0GB. [2023-12-16 03:36:04,728 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.13ms. Allocated memory is still 200.3MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.72ms. Allocated memory is still 200.3MB. Free memory was 140.7MB in the beginning and 128.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.01ms. Allocated memory is still 200.3MB. Free memory was 128.0MB in the beginning and 125.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.80ms. Allocated memory is still 200.3MB. Free memory was 125.2MB in the beginning and 121.3MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 435.33ms. Allocated memory was 200.3MB in the beginning and 261.1MB in the end (delta: 60.8MB). Free memory was 121.0MB in the beginning and 212.1MB in the end (delta: -91.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * TraceAbstraction took 7768.13ms. Allocated memory was 261.1MB in the beginning and 376.4MB in the end (delta: 115.3MB). Free memory was 211.6MB in the beginning and 145.9MB in the end (delta: 65.6MB). Peak memory consumption was 181.0MB. Max. memory is 8.0GB. * 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 to_int at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 5; [L23] unsigned char var_1_6 = 1; [L24] signed long int var_1_7 = 0; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] signed long int var_1_12 = 15; [L29] signed long int var_1_13 = 1; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] signed long int var_1_16 = 16; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] signed long int last_1_var_1_12 = 15; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_12 = var_1_12 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L80] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L80] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L83] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L83] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L84] var_1_13 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L86] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L86] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L88] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L95] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L96] var_1_18 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L97] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L98] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L98] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L48] COND TRUE var_1_19 > var_1_9 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L49] COND TRUE \read(var_1_6) [L50] var_1_12 = (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=16, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=16, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=16, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L69] var_1_17 = var_1_18 [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((signed long int) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((signed long int) (var_1_13 - var_1_16))) : (var_1_12 == ((signed long int) var_1_16)))) : (var_1_12 == ((signed long int) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=-2, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=126, var_1_18=126, var_1_19=8, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=-2, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=126, var_1_18=126, var_1_19=8, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 441 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 2714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 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 [2023-12-16 03:36:04,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...