/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 12:06:40,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 12:06:40,555 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-19 12:06:40,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 12:06:40,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 12:06:40,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 12:06:40,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 12:06:40,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 12:06:40,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 12:06:40,584 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 12:06:40,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 12:06:40,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 12:06:40,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 12:06:40,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 12:06:40,587 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 12:06:40,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 12:06:40,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 12:06:40,587 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 12:06:40,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 12:06:40,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 12:06:40,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 12:06:40,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 12:06:40,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 12:06:40,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 12:06:40,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 12:06:40,589 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 12:06:40,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 12:06:40,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 12:06:40,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 12:06:40,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 12:06:40,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 12:06:40,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 12:06:40,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 12:06:40,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 12:06:40,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 12:06:40,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 12:06:40,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 12:06:40,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 12:06:40,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 12:06:40,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 12:06:40,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 12:06:40,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 12:06:40,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 12:06:40,592 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 -> true [2023-12-19 12:06:40,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 12:06:40,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 12:06:40,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 12:06:40,798 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 12:06:40,798 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 12:06:40,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-12-19 12:06:41,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 12:06:42,061 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 12:06:42,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-12-19 12:06:42,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1923b28e0/465ded11c9b148b7bc80ff5210d2078c/FLAG12bd356af [2023-12-19 12:06:42,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1923b28e0/465ded11c9b148b7bc80ff5210d2078c [2023-12-19 12:06:42,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 12:06:42,083 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 12:06:42,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 12:06:42,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 12:06:42,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 12:06:42,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e68c838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42, skipping insertion in model container [2023-12-19 12:06:42,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,124 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 12:06:42,244 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_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-12-19 12:06:42,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 12:06:42,294 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 12:06:42,302 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_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-12-19 12:06:42,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 12:06:42,343 INFO L206 MainTranslator]: Completed translation [2023-12-19 12:06:42,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42 WrapperNode [2023-12-19 12:06:42,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 12:06:42,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 12:06:42,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 12:06:42,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 12:06:42,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,389 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2023-12-19 12:06:42,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 12:06:42,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 12:06:42,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 12:06:42,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 12:06:42,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,410 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-19 12:06:42,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 12:06:42,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 12:06:42,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 12:06:42,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 12:06:42,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (1/1) ... [2023-12-19 12:06:42,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 12:06:42,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 12:06:42,461 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-19 12:06:42,488 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-19 12:06:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 12:06:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 12:06:42,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 12:06:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 12:06:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 12:06:42,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 12:06:42,585 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 12:06:42,587 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 12:06:42,816 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 12:06:42,861 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 12:06:42,862 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 12:06:42,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:06:42 BoogieIcfgContainer [2023-12-19 12:06:42,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 12:06:42,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 12:06:42,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 12:06:42,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 12:06:42,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:06:42" (1/3) ... [2023-12-19 12:06:42,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e4a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:06:42, skipping insertion in model container [2023-12-19 12:06:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:06:42" (2/3) ... [2023-12-19 12:06:42,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e4a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:06:42, skipping insertion in model container [2023-12-19 12:06:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:06:42" (3/3) ... [2023-12-19 12:06:42,900 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-12-19 12:06:42,925 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 12:06:42,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 12:06:42,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 12:06:42,991 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;@5b32c6e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 12:06:42,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 12:06:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 12:06:43,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:43,013 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:43,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:43,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 295685964, now seen corresponding path program 1 times [2023-12-19 12:06:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:43,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005821100] [2023-12-19 12:06:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005821100] [2023-12-19 12:06:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005821100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 12:06:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675464911] [2023-12-19 12:06:43,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:43,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 12:06:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 12:06:43,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 12:06:43,463 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 12:06:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:43,511 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2023-12-19 12:06:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 12:06:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2023-12-19 12:06:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:43,518 INFO L225 Difference]: With dead ends: 123 [2023-12-19 12:06:43,518 INFO L226 Difference]: Without dead ends: 60 [2023-12-19 12:06:43,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-19 12:06:43,524 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:43,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:06:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-19 12:06:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-19 12:06:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2023-12-19 12:06:43,557 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 112 [2023-12-19 12:06:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:43,557 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2023-12-19 12:06:43,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 12:06:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2023-12-19 12:06:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 12:06:43,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:43,559 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:43,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 12:06:43,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:43,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2019143656, now seen corresponding path program 1 times [2023-12-19 12:06:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550904416] [2023-12-19 12:06:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550904416] [2023-12-19 12:06:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550904416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 12:06:43,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024071591] [2023-12-19 12:06:43,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 12:06:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 12:06:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:06:43,778 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:43,828 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2023-12-19 12:06:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 12:06:43,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-12-19 12:06:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:43,830 INFO L225 Difference]: With dead ends: 143 [2023-12-19 12:06:43,830 INFO L226 Difference]: Without dead ends: 84 [2023-12-19 12:06:43,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-19 12:06:43,832 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 27 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:43,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 172 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:06:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-19 12:06:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-12-19 12:06:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2023-12-19 12:06:43,843 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 112 [2023-12-19 12:06:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:43,844 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2023-12-19 12:06:43,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2023-12-19 12:06:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 12:06:43,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:43,846 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:43,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 12:06:43,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:43,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -333592616, now seen corresponding path program 1 times [2023-12-19 12:06:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023377678] [2023-12-19 12:06:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023377678] [2023-12-19 12:06:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023377678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:06:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444393894] [2023-12-19 12:06:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:44,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:06:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:44,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:06:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:06:44,367 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:44,602 INFO L93 Difference]: Finished difference Result 211 states and 322 transitions. [2023-12-19 12:06:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 12:06:44,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-12-19 12:06:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:44,608 INFO L225 Difference]: With dead ends: 211 [2023-12-19 12:06:44,608 INFO L226 Difference]: Without dead ends: 141 [2023-12-19 12:06:44,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-19 12:06:44,613 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 177 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:44,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 231 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 12:06:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-19 12:06:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2023-12-19 12:06:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2023-12-19 12:06:44,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 112 [2023-12-19 12:06:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:44,637 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2023-12-19 12:06:44,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2023-12-19 12:06:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 12:06:44,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:44,643 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:44,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 12:06:44,643 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:44,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1344709866, now seen corresponding path program 1 times [2023-12-19 12:06:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:44,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615854333] [2023-12-19 12:06:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615854333] [2023-12-19 12:06:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615854333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 12:06:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444155202] [2023-12-19 12:06:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 12:06:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 12:06:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 12:06:44,981 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:45,232 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2023-12-19 12:06:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 12:06:45,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2023-12-19 12:06:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:45,235 INFO L225 Difference]: With dead ends: 243 [2023-12-19 12:06:45,235 INFO L226 Difference]: Without dead ends: 151 [2023-12-19 12:06:45,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 12:06:45,244 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:45,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 499 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 12:06:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-19 12:06:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2023-12-19 12:06:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 157 transitions. [2023-12-19 12:06:45,278 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 157 transitions. Word has length 112 [2023-12-19 12:06:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:45,278 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 157 transitions. [2023-12-19 12:06:45,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 157 transitions. [2023-12-19 12:06:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 12:06:45,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:45,281 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:45,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 12:06:45,281 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:45,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash -575654869, now seen corresponding path program 1 times [2023-12-19 12:06:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:45,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82274392] [2023-12-19 12:06:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82274392] [2023-12-19 12:06:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82274392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:06:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083740439] [2023-12-19 12:06:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:06:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:06:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:06:45,581 INFO L87 Difference]: Start difference. First operand 105 states and 157 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:45,726 INFO L93 Difference]: Finished difference Result 296 states and 440 transitions. [2023-12-19 12:06:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 12:06:45,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 12:06:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:45,727 INFO L225 Difference]: With dead ends: 296 [2023-12-19 12:06:45,727 INFO L226 Difference]: Without dead ends: 192 [2023-12-19 12:06:45,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:06:45,728 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 164 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:45,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 308 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:06:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-19 12:06:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 114. [2023-12-19 12:06:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2023-12-19 12:06:45,753 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 113 [2023-12-19 12:06:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:45,754 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2023-12-19 12:06:45,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2023-12-19 12:06:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 12:06:45,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:45,755 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:45,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 12:06:45,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:45,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1855518547, now seen corresponding path program 1 times [2023-12-19 12:06:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32012343] [2023-12-19 12:06:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:46,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32012343] [2023-12-19 12:06:46,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32012343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 12:06:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057732033] [2023-12-19 12:06:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:46,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 12:06:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:46,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 12:06:46,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 12:06:46,101 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:46,442 INFO L93 Difference]: Finished difference Result 290 states and 419 transitions. [2023-12-19 12:06:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 12:06:46,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 12:06:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:46,443 INFO L225 Difference]: With dead ends: 290 [2023-12-19 12:06:46,443 INFO L226 Difference]: Without dead ends: 177 [2023-12-19 12:06:46,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-19 12:06:46,444 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 74 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:46,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 545 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 12:06:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-19 12:06:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2023-12-19 12:06:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2023-12-19 12:06:46,459 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 113 [2023-12-19 12:06:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:46,459 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2023-12-19 12:06:46,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2023-12-19 12:06:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 12:06:46,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:46,460 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:46,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 12:06:46,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:46,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash 875923400, now seen corresponding path program 1 times [2023-12-19 12:06:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925642064] [2023-12-19 12:06:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:46,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:46,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925642064] [2023-12-19 12:06:46,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925642064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:46,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 12:06:46,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330261184] [2023-12-19 12:06:46,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:46,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 12:06:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 12:06:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:06:46,531 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:46,590 INFO L93 Difference]: Finished difference Result 296 states and 414 transitions. [2023-12-19 12:06:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 12:06:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 12:06:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:46,591 INFO L225 Difference]: With dead ends: 296 [2023-12-19 12:06:46,591 INFO L226 Difference]: Without dead ends: 174 [2023-12-19 12:06:46,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-19 12:06:46,592 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 69 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:46,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 173 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:06:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-19 12:06:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 114. [2023-12-19 12:06:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-12-19 12:06:46,614 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 113 [2023-12-19 12:06:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:46,614 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-12-19 12:06:46,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-12-19 12:06:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:46,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:46,615 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:46,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 12:06:46,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:46,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1253748688, now seen corresponding path program 1 times [2023-12-19 12:06:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368031644] [2023-12-19 12:06:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368031644] [2023-12-19 12:06:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368031644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:47,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 12:06:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082721449] [2023-12-19 12:06:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:47,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 12:06:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:47,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 12:06:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 12:06:47,006 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:47,528 INFO L93 Difference]: Finished difference Result 298 states and 413 transitions. [2023-12-19 12:06:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 12:06:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-19 12:06:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:47,530 INFO L225 Difference]: With dead ends: 298 [2023-12-19 12:06:47,530 INFO L226 Difference]: Without dead ends: 185 [2023-12-19 12:06:47,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-19 12:06:47,532 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:47,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 697 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 12:06:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-19 12:06:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 115. [2023-12-19 12:06:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:06:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2023-12-19 12:06:47,552 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 114 [2023-12-19 12:06:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:47,552 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2023-12-19 12:06:47,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2023-12-19 12:06:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:47,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:47,553 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:47,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 12:06:47,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:47,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -242722383, now seen corresponding path program 1 times [2023-12-19 12:06:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24009556] [2023-12-19 12:06:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24009556] [2023-12-19 12:06:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24009556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:48,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:06:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766966832] [2023-12-19 12:06:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:06:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:06:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:06:48,072 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:48,240 INFO L93 Difference]: Finished difference Result 318 states and 438 transitions. [2023-12-19 12:06:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 12:06:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-19 12:06:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:48,241 INFO L225 Difference]: With dead ends: 318 [2023-12-19 12:06:48,242 INFO L226 Difference]: Without dead ends: 204 [2023-12-19 12:06:48,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 12:06:48,243 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 67 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:48,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 297 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:06:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-19 12:06:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2023-12-19 12:06:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 180 states have (on average 1.3277777777777777) internal successors, (239), 181 states have internal predecessors, (239), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 12:06:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2023-12-19 12:06:48,271 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 114 [2023-12-19 12:06:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:48,271 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2023-12-19 12:06:48,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2023-12-19 12:06:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:48,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:48,272 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:48,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 12:06:48,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:48,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1522586061, now seen corresponding path program 1 times [2023-12-19 12:06:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:48,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29163463] [2023-12-19 12:06:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:48,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:48,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29163463] [2023-12-19 12:06:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29163463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 12:06:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291773673] [2023-12-19 12:06:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:48,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 12:06:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 12:06:48,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 12:06:48,487 INFO L87 Difference]: Start difference. First operand 201 states and 275 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:48,687 INFO L93 Difference]: Finished difference Result 475 states and 647 transitions. [2023-12-19 12:06:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 12:06:48,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-19 12:06:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:48,691 INFO L225 Difference]: With dead ends: 475 [2023-12-19 12:06:48,691 INFO L226 Difference]: Without dead ends: 275 [2023-12-19 12:06:48,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 12:06:48,692 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 70 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:48,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 533 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:06:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-12-19 12:06:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 217. [2023-12-19 12:06:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 196 states have (on average 1.3112244897959184) internal successors, (257), 197 states have internal predecessors, (257), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 12:06:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 293 transitions. [2023-12-19 12:06:48,727 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 293 transitions. Word has length 114 [2023-12-19 12:06:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:48,729 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 293 transitions. [2023-12-19 12:06:48,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 293 transitions. [2023-12-19 12:06:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:48,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:48,730 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:48,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 12:06:48,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:48,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -39145174, now seen corresponding path program 1 times [2023-12-19 12:06:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:48,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700282010] [2023-12-19 12:06:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700282010] [2023-12-19 12:06:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700282010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 12:06:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24468587] [2023-12-19 12:06:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:48,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 12:06:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 12:06:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:06:48,812 INFO L87 Difference]: Start difference. First operand 217 states and 293 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:48,887 INFO L93 Difference]: Finished difference Result 487 states and 659 transitions. [2023-12-19 12:06:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 12:06:48,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-19 12:06:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:48,889 INFO L225 Difference]: With dead ends: 487 [2023-12-19 12:06:48,889 INFO L226 Difference]: Without dead ends: 271 [2023-12-19 12:06:48,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-19 12:06:48,890 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 65 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:48,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 206 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:06:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-19 12:06:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 195. [2023-12-19 12:06:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.3045977011494252) internal successors, (227), 175 states have internal predecessors, (227), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 12:06:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2023-12-19 12:06:48,919 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 114 [2023-12-19 12:06:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:48,920 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2023-12-19 12:06:48,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2023-12-19 12:06:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:48,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:48,921 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:48,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 12:06:48,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:48,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 189997531, now seen corresponding path program 1 times [2023-12-19 12:06:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:48,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207854493] [2023-12-19 12:06:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207854493] [2023-12-19 12:06:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207854493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:48,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:48,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 12:06:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670323800] [2023-12-19 12:06:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:48,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 12:06:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 12:06:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:06:48,980 INFO L87 Difference]: Start difference. First operand 195 states and 263 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:49,076 INFO L93 Difference]: Finished difference Result 501 states and 669 transitions. [2023-12-19 12:06:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 12:06:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-19 12:06:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:49,078 INFO L225 Difference]: With dead ends: 501 [2023-12-19 12:06:49,078 INFO L226 Difference]: Without dead ends: 307 [2023-12-19 12:06:49,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-19 12:06:49,080 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:49,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 157 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:06:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-12-19 12:06:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 245. [2023-12-19 12:06:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 224 states have (on average 1.28125) internal successors, (287), 225 states have internal predecessors, (287), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 12:06:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2023-12-19 12:06:49,117 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 114 [2023-12-19 12:06:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:49,117 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2023-12-19 12:06:49,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2023-12-19 12:06:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:49,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:49,119 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 12:06:49,119 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:49,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash 191844573, now seen corresponding path program 1 times [2023-12-19 12:06:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964571043] [2023-12-19 12:06:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:49,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:06:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 12:06:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 12:06:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 12:06:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 12:06:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 12:06:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 12:06:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:06:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:06:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 12:06:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 12:06:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 12:06:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 12:06:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 12:06:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 12:06:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 12:06:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:06:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:06:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:06:49,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964571043] [2023-12-19 12:06:49,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964571043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:06:49,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:06:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:06:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725238171] [2023-12-19 12:06:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:06:49,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:06:49,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:06:49,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:06:49,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:06:49,404 INFO L87 Difference]: Start difference. First operand 245 states and 323 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:06:49,547 INFO L93 Difference]: Finished difference Result 626 states and 829 transitions. [2023-12-19 12:06:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 12:06:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-12-19 12:06:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:06:49,549 INFO L225 Difference]: With dead ends: 626 [2023-12-19 12:06:49,550 INFO L226 Difference]: Without dead ends: 382 [2023-12-19 12:06:49,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 12:06:49,551 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 105 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:06:49,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 295 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:06:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-12-19 12:06:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 278. [2023-12-19 12:06:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 240 states have (on average 1.2625) internal successors, (303), 241 states have internal predecessors, (303), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 12:06:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2023-12-19 12:06:49,594 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 114 [2023-12-19 12:06:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:06:49,595 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2023-12-19 12:06:49,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:06:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2023-12-19 12:06:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 12:06:49,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:06:49,596 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:06:49,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 12:06:49,596 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:06:49,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:06:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 614546399, now seen corresponding path program 1 times [2023-12-19 12:06:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:06:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000183548] [2023-12-19 12:06:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:06:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:06:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 12:06:49,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 12:06:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 12:06:49,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 12:06:49,701 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 12:06:49,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 12:06:49,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 12:06:49,705 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:06:49,707 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 12:06:49,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:06:49 BoogieIcfgContainer [2023-12-19 12:06:49,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 12:06:49,752 INFO L158 Benchmark]: Toolchain (without parser) took 7669.23ms. Allocated memory was 326.1MB in the beginning and 476.1MB in the end (delta: 149.9MB). Free memory was 273.3MB in the beginning and 201.2MB in the end (delta: 72.1MB). Peak memory consumption was 222.9MB. Max. memory is 8.0GB. [2023-12-19 12:06:49,752 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 12:06:49,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.63ms. Allocated memory is still 326.1MB. Free memory was 273.3MB in the beginning and 258.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 12:06:49,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.96ms. Allocated memory is still 326.1MB. Free memory was 258.6MB in the beginning and 255.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 12:06:49,753 INFO L158 Benchmark]: Boogie Preprocessor took 33.72ms. Allocated memory is still 326.1MB. Free memory was 255.1MB in the beginning and 249.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 12:06:49,753 INFO L158 Benchmark]: RCFGBuilder took 437.42ms. Allocated memory is still 326.1MB. Free memory was 249.9MB in the beginning and 290.2MB in the end (delta: -40.3MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2023-12-19 12:06:49,753 INFO L158 Benchmark]: TraceAbstraction took 6870.35ms. Allocated memory was 326.1MB in the beginning and 476.1MB in the end (delta: 149.9MB). Free memory was 289.6MB in the beginning and 201.2MB in the end (delta: 88.4MB). Peak memory consumption was 238.9MB. Max. memory is 8.0GB. [2023-12-19 12:06:49,754 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.11ms. Allocated memory is still 203.4MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.63ms. Allocated memory is still 326.1MB. Free memory was 273.3MB in the beginning and 258.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.96ms. Allocated memory is still 326.1MB. Free memory was 258.6MB in the beginning and 255.1MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.72ms. Allocated memory is still 326.1MB. Free memory was 255.1MB in the beginning and 249.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 437.42ms. Allocated memory is still 326.1MB. Free memory was 249.9MB in the beginning and 290.2MB in the end (delta: -40.3MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6870.35ms. Allocated memory was 326.1MB in the beginning and 476.1MB in the end (delta: 149.9MB). Free memory was 289.6MB in the beginning and 201.2MB in the end (delta: 88.4MB). Peak memory consumption was 238.9MB. 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 someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=505, var_1_1=66, var_1_22=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1117 mSDsluCounter, 4201 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2701 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1725 IncrementalHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1500 mSDtfsCounter, 1725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=13, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 672 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1585 NumberOfCodeBlocks, 1585 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1458 ConstructedInterpolants, 0 QuantifiedInterpolants, 4023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6240/6240 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-19 12:06:49,796 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...