/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_variablewrapping_normal_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:47:53,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:47:53,055 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 14:47:53,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:47:53,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:47:53,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:47:53,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:47:53,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:47:53,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:47:53,083 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:47:53,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:47:53,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:47:53,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:47:53,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:47:53,085 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:47:53,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:47:53,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:47:53,086 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:47:53,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:47:53,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:47:53,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:47:53,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:47:53,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:47:53,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:47:53,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:47:53,088 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:47:53,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:47:53,088 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:47:53,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:47:53,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:47:53,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:47:53,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:47:53,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:47:53,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:47:53,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:47:53,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:47:53,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:47:53,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:47:53,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:47:53,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:47:53,091 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:47:53,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:47:53,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:47:53,091 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 14:47:53,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:47:53,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:47:53,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:47:53,314 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:47:53,314 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:47:53,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2023-12-19 14:47:54,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:47:54,630 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:47:54,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2023-12-19 14:47:54,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efa2dc3b/f5320a05294a4327b0c7e17f4310a337/FLAG22cfcd246 [2023-12-19 14:47:54,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efa2dc3b/f5320a05294a4327b0c7e17f4310a337 [2023-12-19 14:47:54,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:47:54,648 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:47:54,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:47:54,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:47:54,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:47:54,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b8a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54, skipping insertion in model container [2023-12-19 14:47:54,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,668 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:47:54,753 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_variablewrapping_normal_file-33.i[913,926] [2023-12-19 14:47:54,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:47:54,800 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:47:54,809 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_variablewrapping_normal_file-33.i[913,926] [2023-12-19 14:47:54,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:47:54,853 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:47:54,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54 WrapperNode [2023-12-19 14:47:54,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:47:54,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:47:54,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:47:54,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:47:54,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,911 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2023-12-19 14:47:54,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:47:54,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:47:54,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:47:54,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:47:54,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,935 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 14:47:54,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:47:54,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:47:54,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:47:54,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:47:54,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (1/1) ... [2023-12-19 14:47:54,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:47:54,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:47:54,986 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 14:47:55,014 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 14:47:55,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:47:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:47:55,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:47:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:47:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:47:55,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:47:55,117 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:47:55,121 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:47:55,363 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:47:55,397 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:47:55,397 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:47:55,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:47:55 BoogieIcfgContainer [2023-12-19 14:47:55,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:47:55,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:47:55,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:47:55,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:47:55,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:47:54" (1/3) ... [2023-12-19 14:47:55,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4444c7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:47:55, skipping insertion in model container [2023-12-19 14:47:55,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:47:54" (2/3) ... [2023-12-19 14:47:55,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4444c7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:47:55, skipping insertion in model container [2023-12-19 14:47:55,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:47:55" (3/3) ... [2023-12-19 14:47:55,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2023-12-19 14:47:55,419 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:47:55,419 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:47:55,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:47:55,461 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;@76704bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:47:55,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:47:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-19 14:47:55,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:55,483 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:55,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:55,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash -169966129, now seen corresponding path program 1 times [2023-12-19 14:47:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955915151] [2023-12-19 14:47:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955915151] [2023-12-19 14:47:55,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955915151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:55,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:47:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346099249] [2023-12-19 14:47:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:55,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:47:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:47:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:47:55,773 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 14:47:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:55,812 INFO L93 Difference]: Finished difference Result 105 states and 177 transitions. [2023-12-19 14:47:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:47:55,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2023-12-19 14:47:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:55,819 INFO L225 Difference]: With dead ends: 105 [2023-12-19 14:47:55,819 INFO L226 Difference]: Without dead ends: 52 [2023-12-19 14:47:55,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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 14:47:55,824 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:55,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:47:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-19 14:47:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-19 14:47:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2023-12-19 14:47:55,862 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 70 [2023-12-19 14:47:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:55,863 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2023-12-19 14:47:55,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 14:47:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2023-12-19 14:47:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-19 14:47:55,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:55,865 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:55,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:47:55,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:55,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -353899831, now seen corresponding path program 1 times [2023-12-19 14:47:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123923339] [2023-12-19 14:47:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123923339] [2023-12-19 14:47:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123923339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:47:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468346412] [2023-12-19 14:47:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:47:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:47:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:47:56,048 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:56,075 INFO L93 Difference]: Finished difference Result 104 states and 161 transitions. [2023-12-19 14:47:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:47:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-19 14:47:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:56,076 INFO L225 Difference]: With dead ends: 104 [2023-12-19 14:47:56,076 INFO L226 Difference]: Without dead ends: 53 [2023-12-19 14:47:56,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 14:47:56,078 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:56,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:47:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-19 14:47:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-19 14:47:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.5) internal successors, (63), 42 states have internal predecessors, (63), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2023-12-19 14:47:56,084 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 70 [2023-12-19 14:47:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:56,085 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2023-12-19 14:47:56,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2023-12-19 14:47:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-19 14:47:56,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:56,087 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:56,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:47:56,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:56,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:56,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1163246457, now seen corresponding path program 1 times [2023-12-19 14:47:56,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:56,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551994384] [2023-12-19 14:47:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:56,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551994384] [2023-12-19 14:47:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551994384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:56,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:47:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097222907] [2023-12-19 14:47:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:47:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:47:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:47:56,191 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:56,344 INFO L93 Difference]: Finished difference Result 136 states and 207 transitions. [2023-12-19 14:47:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:47:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-19 14:47:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:56,350 INFO L225 Difference]: With dead ends: 136 [2023-12-19 14:47:56,350 INFO L226 Difference]: Without dead ends: 84 [2023-12-19 14:47:56,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:47:56,356 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 99 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:56,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 242 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:47:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-19 14:47:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2023-12-19 14:47:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-12-19 14:47:56,368 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 70 [2023-12-19 14:47:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:56,368 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-12-19 14:47:56,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-12-19 14:47:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-19 14:47:56,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:56,370 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:56,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:47:56,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:56,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash -462181879, now seen corresponding path program 1 times [2023-12-19 14:47:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:56,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264132261] [2023-12-19 14:47:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264132261] [2023-12-19 14:47:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264132261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:47:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364289868] [2023-12-19 14:47:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:57,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:47:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:47:57,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:47:57,968 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:58,687 INFO L93 Difference]: Finished difference Result 218 states and 333 transitions. [2023-12-19 14:47:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 14:47:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-19 14:47:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:58,690 INFO L225 Difference]: With dead ends: 218 [2023-12-19 14:47:58,690 INFO L226 Difference]: Without dead ends: 164 [2023-12-19 14:47:58,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2023-12-19 14:47:58,691 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 361 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:58,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 263 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 14:47:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-19 14:47:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 71. [2023-12-19 14:47:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 60 states have internal predecessors, (89), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2023-12-19 14:47:58,705 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 70 [2023-12-19 14:47:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:58,706 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2023-12-19 14:47:58,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2023-12-19 14:47:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-19 14:47:58,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:58,707 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:58,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 14:47:58,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:58,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:58,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2050529781, now seen corresponding path program 1 times [2023-12-19 14:47:58,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:58,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930580901] [2023-12-19 14:47:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930580901] [2023-12-19 14:47:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930580901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 14:47:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30678677] [2023-12-19 14:47:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:59,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 14:47:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 14:47:59,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:47:59,041 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:59,294 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2023-12-19 14:47:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 14:47:59,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2023-12-19 14:47:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:59,296 INFO L225 Difference]: With dead ends: 205 [2023-12-19 14:47:59,296 INFO L226 Difference]: Without dead ends: 135 [2023-12-19 14:47:59,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:47:59,297 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 144 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:59,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:47:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-19 14:47:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 78. [2023-12-19 14:47:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.507462686567164) internal successors, (101), 67 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2023-12-19 14:47:59,302 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 70 [2023-12-19 14:47:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:59,303 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2023-12-19 14:47:59,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2023-12-19 14:47:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-19 14:47:59,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:59,307 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:59,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 14:47:59,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:59,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 47215431, now seen corresponding path program 1 times [2023-12-19 14:47:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205345151] [2023-12-19 14:47:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205345151] [2023-12-19 14:47:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205345151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:47:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240232053] [2023-12-19 14:47:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:47:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:47:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:47:59,366 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:59,395 INFO L93 Difference]: Finished difference Result 205 states and 312 transitions. [2023-12-19 14:47:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:47:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2023-12-19 14:47:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:59,397 INFO L225 Difference]: With dead ends: 205 [2023-12-19 14:47:59,398 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 14:47:59,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 14:47:59,399 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 50 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:59,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:47:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 14:47:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2023-12-19 14:47:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 84 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2023-12-19 14:47:59,418 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 71 [2023-12-19 14:47:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:59,418 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2023-12-19 14:47:59,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2023-12-19 14:47:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-19 14:47:59,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:59,419 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:59,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 14:47:59,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:59,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -659479525, now seen corresponding path program 1 times [2023-12-19 14:47:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743194676] [2023-12-19 14:47:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:47:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:47:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:47:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:47:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:47:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:47:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:47:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:47:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:47:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:47:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:47:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:47:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743194676] [2023-12-19 14:47:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743194676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:47:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:47:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:47:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918812961] [2023-12-19 14:47:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:47:59,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:47:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:47:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:47:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:47:59,463 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:47:59,489 INFO L93 Difference]: Finished difference Result 222 states and 331 transitions. [2023-12-19 14:47:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:47:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2023-12-19 14:47:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:47:59,491 INFO L225 Difference]: With dead ends: 222 [2023-12-19 14:47:59,491 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 14:47:59,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 14:47:59,494 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 65 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:47:59,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 136 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:47:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 14:47:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 81. [2023-12-19 14:47:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:47:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2023-12-19 14:47:59,506 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 71 [2023-12-19 14:47:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:47:59,506 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2023-12-19 14:47:59,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:47:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2023-12-19 14:47:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-19 14:47:59,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:47:59,510 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:59,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 14:47:59,510 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:47:59,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:47:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash 221241, now seen corresponding path program 1 times [2023-12-19 14:47:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:47:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056151397] [2023-12-19 14:47:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:47:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:47:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:48:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:48:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:48:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:48:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:48:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:48:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:48:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:48:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:48:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:48:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:48:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056151397] [2023-12-19 14:48:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056151397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:48:00,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:48:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:48:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495738049] [2023-12-19 14:48:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:48:00,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:48:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:48:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:48:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:48:00,126 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:48:00,523 INFO L93 Difference]: Finished difference Result 263 states and 384 transitions. [2023-12-19 14:48:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 14:48:00,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2023-12-19 14:48:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:48:00,525 INFO L225 Difference]: With dead ends: 263 [2023-12-19 14:48:00,525 INFO L226 Difference]: Without dead ends: 183 [2023-12-19 14:48:00,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-12-19 14:48:00,525 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 231 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 14:48:00,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 241 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 14:48:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-19 14:48:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 66. [2023-12-19 14:48:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 14:48:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2023-12-19 14:48:00,529 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 71 [2023-12-19 14:48:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:48:00,529 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2023-12-19 14:48:00,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2023-12-19 14:48:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-19 14:48:00,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:48:00,530 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:00,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 14:48:00,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:48:00,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:48:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1774044299, now seen corresponding path program 1 times [2023-12-19 14:48:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:48:00,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090671954] [2023-12-19 14:48:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:48:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:48:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:48:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:48:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:48:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:48:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:48:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:48:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:48:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:48:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:48:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:48:00,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:48:00,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090671954] [2023-12-19 14:48:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090671954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:48:00,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:48:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:48:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774765455] [2023-12-19 14:48:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:48:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:48:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:48:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:48:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:48:00,609 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:48:00,772 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2023-12-19 14:48:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:48:00,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2023-12-19 14:48:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:48:00,774 INFO L225 Difference]: With dead ends: 215 [2023-12-19 14:48:00,774 INFO L226 Difference]: Without dead ends: 150 [2023-12-19 14:48:00,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:48:00,774 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 203 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:48:00,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 287 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:48:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-19 14:48:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2023-12-19 14:48:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 114 states have internal predecessors, (157), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 14:48:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 197 transitions. [2023-12-19 14:48:00,782 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 197 transitions. Word has length 72 [2023-12-19 14:48:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:48:00,782 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 197 transitions. [2023-12-19 14:48:00,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 197 transitions. [2023-12-19 14:48:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-19 14:48:00,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:48:00,783 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 14:48:00,783 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:48:00,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:48:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1515878861, now seen corresponding path program 1 times [2023-12-19 14:48:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:48:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559758018] [2023-12-19 14:48:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:48:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:48:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:48:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:48:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:48:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:48:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:48:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:48:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:48:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:48:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:48:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:48:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:48:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559758018] [2023-12-19 14:48:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559758018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:48:01,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:48:01,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:48:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818667831] [2023-12-19 14:48:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:48:01,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:48:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:48:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:48:01,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:48:01,235 INFO L87 Difference]: Start difference. First operand 137 states and 197 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:48:01,711 INFO L93 Difference]: Finished difference Result 391 states and 564 transitions. [2023-12-19 14:48:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 14:48:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2023-12-19 14:48:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:48:01,713 INFO L225 Difference]: With dead ends: 391 [2023-12-19 14:48:01,713 INFO L226 Difference]: Without dead ends: 258 [2023-12-19 14:48:01,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-12-19 14:48:01,714 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 210 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 14:48:01,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 269 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 14:48:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-19 14:48:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 169. [2023-12-19 14:48:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 146 states have internal predecessors, (204), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 14:48:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2023-12-19 14:48:01,723 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 72 [2023-12-19 14:48:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:48:01,723 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2023-12-19 14:48:01,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2023-12-19 14:48:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-19 14:48:01,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:48:01,724 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:01,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 14:48:01,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:48:01,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:48:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1090144693, now seen corresponding path program 1 times [2023-12-19 14:48:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:48:01,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912408748] [2023-12-19 14:48:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:48:01,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:48:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:48:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:48:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:48:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:48:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:48:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:48:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:48:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:48:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:48:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 14:48:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:48:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912408748] [2023-12-19 14:48:01,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912408748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:48:01,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:48:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:48:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645372930] [2023-12-19 14:48:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:48:01,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:48:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:48:01,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:48:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:48:01,785 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:48:01,841 INFO L93 Difference]: Finished difference Result 465 states and 671 transitions. [2023-12-19 14:48:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:48:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2023-12-19 14:48:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:48:01,842 INFO L225 Difference]: With dead ends: 465 [2023-12-19 14:48:01,842 INFO L226 Difference]: Without dead ends: 300 [2023-12-19 14:48:01,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 14:48:01,843 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:48:01,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 149 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:48:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-19 14:48:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 239. [2023-12-19 14:48:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 203 states have (on average 1.3990147783251232) internal successors, (284), 205 states have internal predecessors, (284), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-19 14:48:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 342 transitions. [2023-12-19 14:48:01,855 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 342 transitions. Word has length 72 [2023-12-19 14:48:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:48:01,855 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 342 transitions. [2023-12-19 14:48:01,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 14:48:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 342 transitions. [2023-12-19 14:48:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-19 14:48:01,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:48:01,855 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 14:48:01,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:48:01,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:48:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2071902132, now seen corresponding path program 1 times [2023-12-19 14:48:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:48:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101926596] [2023-12-19 14:48:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:48:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:48:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:48:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 14:48:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 14:48:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 14:48:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 14:48:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 14:48:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 14:48:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 14:48:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:48:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-19 14:48:01,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:48:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101926596] [2023-12-19 14:48:01,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101926596] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 14:48:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133163992] [2023-12-19 14:48:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:48:01,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 14:48:01,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:48:01,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 14:48:01,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 14:48:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:48:02,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 14:48:02,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 14:48:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-19 14:48:02,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 14:48:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-19 14:48:02,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133163992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 14:48:02,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 14:48:02,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-12-19 14:48:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514278556] [2023-12-19 14:48:02,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 14:48:02,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 14:48:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:48:02,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 14:48:02,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-19 14:48:02,338 INFO L87 Difference]: Start difference. First operand 239 states and 342 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-19 14:48:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:48:02,758 INFO L93 Difference]: Finished difference Result 783 states and 1086 transitions. [2023-12-19 14:48:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-19 14:48:02,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 73 [2023-12-19 14:48:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:48:02,760 INFO L225 Difference]: With dead ends: 783 [2023-12-19 14:48:02,760 INFO L226 Difference]: Without dead ends: 677 [2023-12-19 14:48:02,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2023-12-19 14:48:02,761 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 781 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:48:02,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 551 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:48:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2023-12-19 14:48:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 263. [2023-12-19 14:48:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 206 states have internal predecessors, (269), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-19 14:48:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 359 transitions. [2023-12-19 14:48:02,805 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 359 transitions. Word has length 73 [2023-12-19 14:48:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:48:02,805 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 359 transitions. [2023-12-19 14:48:02,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-19 14:48:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 359 transitions. [2023-12-19 14:48:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-19 14:48:02,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:48:02,806 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:02,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 14:48:03,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-19 14:48:03,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:48:03,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:48:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1405416714, now seen corresponding path program 1 times [2023-12-19 14:48:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:48:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505039376] [2023-12-19 14:48:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:48:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:48:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:48:03,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:48:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:48:03,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:48:03,069 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:48:03,070 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:48:03,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 14:48:03,074 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:48:03,090 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:48:03,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:48:03 BoogieIcfgContainer [2023-12-19 14:48:03,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:48:03,141 INFO L158 Benchmark]: Toolchain (without parser) took 8492.88ms. Allocated memory was 381.7MB in the beginning and 550.5MB in the end (delta: 168.8MB). Free memory was 333.0MB in the beginning and 494.7MB in the end (delta: -161.8MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2023-12-19 14:48:03,141 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:48:03,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.01ms. Allocated memory is still 381.7MB. Free memory was 332.7MB in the beginning and 320.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 14:48:03,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.37ms. Allocated memory is still 381.7MB. Free memory was 320.1MB in the beginning and 317.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 14:48:03,141 INFO L158 Benchmark]: Boogie Preprocessor took 39.76ms. Allocated memory is still 381.7MB. Free memory was 317.0MB in the beginning and 313.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 14:48:03,141 INFO L158 Benchmark]: RCFGBuilder took 445.39ms. Allocated memory is still 381.7MB. Free memory was 313.4MB in the beginning and 292.1MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-19 14:48:03,142 INFO L158 Benchmark]: TraceAbstraction took 7740.67ms. Allocated memory was 381.7MB in the beginning and 550.5MB in the end (delta: 168.8MB). Free memory was 291.0MB in the beginning and 494.7MB in the end (delta: -203.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:48:03,142 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.09ms. Allocated memory is still 190.8MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.01ms. Allocated memory is still 381.7MB. Free memory was 332.7MB in the beginning and 320.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.37ms. Allocated memory is still 381.7MB. Free memory was 320.1MB in the beginning and 317.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.76ms. Allocated memory is still 381.7MB. Free memory was 317.0MB in the beginning and 313.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 445.39ms. Allocated memory is still 381.7MB. Free memory was 313.4MB in the beginning and 292.1MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7740.67ms. Allocated memory was 381.7MB in the beginning and 550.5MB in the end (delta: 168.8MB). Free memory was 291.0MB in the beginning and 494.7MB in the end (delta: -203.7MB). There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=400, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=400, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_0=400, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2206 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2198 mSDsluCounter, 2859 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1918 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1915 IncrementalHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 941 mSDtfsCounter, 1915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=12, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 953 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 5862 SizeOfPredicates, 5 NumberOfNonLiveVariables, 194 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1944/2016 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 14:48:03,175 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...