/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:02:35,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:02:35,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:02:35,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:02:35,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:02:35,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:02:35,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:02:35,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:02:35,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:02:35,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:02:35,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:02:35,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:02:35,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:02:35,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:02:35,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:02:35,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:02:35,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:02:35,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:02:35,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:02:35,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:02:35,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:02:35,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:02:35,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:02:35,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:02:35,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:02:35,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:02:35,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:02:35,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:02:35,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:02:35,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:02:35,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:02:35,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:02:35,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:02:35,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:02:35,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:02:35,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:02:35,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:02:35,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:02:35,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:02:35,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:02:35,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:02:35,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:02:35,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:02:35,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:02:35,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:02:35,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:02:35,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:02:35,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:02:35,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:02:35,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:02:35,640 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:02:35,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:02:35,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:02:35,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:02:35,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:02:35,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:02:35,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:02:35,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:02:35,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:02:35,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:02:35,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:02:35,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:02:35,643 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:02:35,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:02:35,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:02:35,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:02:35,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:02:35,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:02:35,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:02:35,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:02:35,821 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:02:35,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2022-01-10 01:02:35,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf5f6830/e655748560514430b2ebf7123404d46c/FLAG89951e620 [2022-01-10 01:02:36,213 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:02:36,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2022-01-10 01:02:36,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf5f6830/e655748560514430b2ebf7123404d46c/FLAG89951e620 [2022-01-10 01:02:36,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf5f6830/e655748560514430b2ebf7123404d46c [2022-01-10 01:02:36,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:02:36,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:02:36,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:02:36,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:02:36,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:02:36,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fba5c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36, skipping insertion in model container [2022-01-10 01:02:36,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:02:36,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:02:36,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c[946,959] [2022-01-10 01:02:36,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:02:36,913 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:02:36,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c[946,959] [2022-01-10 01:02:36,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:02:36,936 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:02:36,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36 WrapperNode [2022-01-10 01:02:36,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:02:36,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:02:36,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:02:36,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:02:36,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,972 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-01-10 01:02:36,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:02:36,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:02:36,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:02:36,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:02:36,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:36,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:02:36,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:02:36,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:02:36,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:02:36,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (1/1) ... [2022-01-10 01:02:37,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:02:37,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:37,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:02:37,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:02:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:02:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:02:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-01-10 01:02:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-01-10 01:02:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-01-10 01:02:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-01-10 01:02:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:02:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:02:37,133 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:02:37,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:02:37,255 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:02:37,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:02:37,259 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:02:37,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:02:37 BoogieIcfgContainer [2022-01-10 01:02:37,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:02:37,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:02:37,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:02:37,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:02:37,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:02:36" (1/3) ... [2022-01-10 01:02:37,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6788f77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:02:37, skipping insertion in model container [2022-01-10 01:02:37,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:36" (2/3) ... [2022-01-10 01:02:37,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6788f77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:02:37, skipping insertion in model container [2022-01-10 01:02:37,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:02:37" (3/3) ... [2022-01-10 01:02:37,265 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2022-01-10 01:02:37,268 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:02:37,269 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:02:37,312 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:02:37,317 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:02:37,317 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:02:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 01:02:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 01:02:37,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:37,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:37,333 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-01-10 01:02:37,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:37,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302432807] [2022-01-10 01:02:37,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:37,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:02:37,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302432807] [2022-01-10 01:02:37,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302432807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:02:37,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:02:37,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:02:37,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461280169] [2022-01-10 01:02:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:02:37,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:02:37,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:02:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:02:37,526 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:02:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:37,562 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-01-10 01:02:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:02:37,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-01-10 01:02:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:37,570 INFO L225 Difference]: With dead ends: 43 [2022-01-10 01:02:37,570 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 01:02:37,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:02:37,582 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 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 [2022-01-10 01:02:37,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:02:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 01:02:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 01:02:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 01:02:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-01-10 01:02:37,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-01-10 01:02:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:37,617 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-01-10 01:02:37,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:02:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-01-10 01:02:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 01:02:37,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:37,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:37,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:02:37,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-01-10 01:02:37,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:37,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310365515] [2022-01-10 01:02:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:37,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:02:37,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:37,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310365515] [2022-01-10 01:02:37,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310365515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:02:37,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:02:37,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:02:37,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490786236] [2022-01-10 01:02:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:02:37,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:02:37,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:02:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:02:37,660 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:02:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:37,671 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-01-10 01:02:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:02:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-10 01:02:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:37,672 INFO L225 Difference]: With dead ends: 33 [2022-01-10 01:02:37,672 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 01:02:37,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:02:37,674 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:37,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:02:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 01:02:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-01-10 01:02:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 01:02:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-01-10 01:02:37,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-01-10 01:02:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:37,679 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-01-10 01:02:37,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:02:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-01-10 01:02:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 01:02:37,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:37,680 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:37,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:02:37,680 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-01-10 01:02:37,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337552472] [2022-01-10 01:02:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:37,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 01:02:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:37,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337552472] [2022-01-10 01:02:37,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337552472] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:37,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223403410] [2022-01-10 01:02:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:37,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:37,745 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) [2022-01-10 01:02:37,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:02:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:37,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:02:37,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:37,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:38,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223403410] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:38,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:38,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-01-10 01:02:38,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058699250] [2022-01-10 01:02:38,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:38,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 01:02:38,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:38,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 01:02:38,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:02:38,030 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 01:02:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:38,147 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-01-10 01:02:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:02:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-01-10 01:02:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:38,148 INFO L225 Difference]: With dead ends: 55 [2022-01-10 01:02:38,149 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 01:02:38,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:02:38,150 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:38,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 01:02:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-10 01:02:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 01:02:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 01:02:38,155 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-01-10 01:02:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:38,155 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 01:02:38,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 01:02:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 01:02:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 01:02:38,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:38,157 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:38,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 01:02:38,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:38,371 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-01-10 01:02:38,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:38,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472398047] [2022-01-10 01:02:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:38,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:38,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:38,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472398047] [2022-01-10 01:02:38,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472398047] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:38,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122825856] [2022-01-10 01:02:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:38,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:38,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:38,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:38,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:02:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:38,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:02:38,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:38,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:38,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122825856] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:38,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:38,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-01-10 01:02:38,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539409444] [2022-01-10 01:02:38,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:38,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 01:02:38,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 01:02:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:02:38,676 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 01:02:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:38,768 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-01-10 01:02:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:02:38,769 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-01-10 01:02:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:38,771 INFO L225 Difference]: With dead ends: 51 [2022-01-10 01:02:38,771 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 01:02:38,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:02:38,772 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:38,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 01:02:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-01-10 01:02:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 01:02:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-01-10 01:02:38,779 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-01-10 01:02:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:38,779 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-01-10 01:02:38,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 01:02:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-01-10 01:02:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 01:02:38,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:38,788 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:38,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:39,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 01:02:39,001 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-01-10 01:02:39,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:39,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144203150] [2022-01-10 01:02:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:39,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 01:02:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:02:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 01:02:39,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:39,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144203150] [2022-01-10 01:02:39,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144203150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:39,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342298683] [2022-01-10 01:02:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:39,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:39,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:39,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:02:39,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:02:39,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 01:02:39,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:02:39,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342298683] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:39,490 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:39,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-01-10 01:02:39,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557566528] [2022-01-10 01:02:39,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:39,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 01:02:39,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 01:02:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-01-10 01:02:39,492 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:39,658 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-01-10 01:02:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 01:02:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-01-10 01:02:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:39,660 INFO L225 Difference]: With dead ends: 105 [2022-01-10 01:02:39,660 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 01:02:39,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-01-10 01:02:39,661 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:39,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 01:02:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-10 01:02:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-01-10 01:02:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-01-10 01:02:39,669 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-01-10 01:02:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:39,669 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-01-10 01:02:39,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-01-10 01:02:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 01:02:39,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:39,670 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:39,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:39,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:39,872 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-01-10 01:02:39,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:39,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814996855] [2022-01-10 01:02:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:39,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:39,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 01:02:40,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:40,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814996855] [2022-01-10 01:02:40,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814996855] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:40,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151336806] [2022-01-10 01:02:40,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:40,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:40,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:40,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:40,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:02:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:02:40,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 01:02:40,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:02:40,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151336806] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:40,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:40,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-01-10 01:02:40,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326372041] [2022-01-10 01:02:40,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:40,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 01:02:40,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 01:02:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:02:40,413 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:40,679 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-01-10 01:02:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 01:02:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2022-01-10 01:02:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:40,681 INFO L225 Difference]: With dead ends: 177 [2022-01-10 01:02:40,681 INFO L226 Difference]: Without dead ends: 117 [2022-01-10 01:02:40,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:02:40,683 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:40,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-10 01:02:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-01-10 01:02:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-01-10 01:02:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-01-10 01:02:40,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-01-10 01:02:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:40,697 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-01-10 01:02:40,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-01-10 01:02:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 01:02:40,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:40,699 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:40,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 01:02:40,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:40,906 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-01-10 01:02:40,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866241521] [2022-01-10 01:02:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:40,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:02:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 01:02:41,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866241521] [2022-01-10 01:02:41,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866241521] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687282397] [2022-01-10 01:02:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:41,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:41,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:41,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:41,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:02:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:41,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:02:41,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 01:02:41,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:02:41,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687282397] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:41,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:41,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2022-01-10 01:02:41,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202347688] [2022-01-10 01:02:41,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:41,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 01:02:41,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 01:02:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-01-10 01:02:41,596 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2022-01-10 01:02:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:41,860 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-01-10 01:02:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 01:02:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) Word has length 51 [2022-01-10 01:02:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:41,863 INFO L225 Difference]: With dead ends: 255 [2022-01-10 01:02:41,863 INFO L226 Difference]: Without dead ends: 155 [2022-01-10 01:02:41,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-01-10 01:02:41,865 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 100 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:41,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 195 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-10 01:02:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-01-10 01:02:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2022-01-10 01:02:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-01-10 01:02:41,879 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-01-10 01:02:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:41,879 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-01-10 01:02:41,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2022-01-10 01:02:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-01-10 01:02:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 01:02:41,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:41,882 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:41,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:42,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:42,101 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:42,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1851863125, now seen corresponding path program 1 times [2022-01-10 01:02:42,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025645660] [2022-01-10 01:02:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:42,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:02:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-10 01:02:42,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:42,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025645660] [2022-01-10 01:02:42,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025645660] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:42,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775905450] [2022-01-10 01:02:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:42,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:42,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:42,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:02:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:42,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:02:42,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-10 01:02:42,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-10 01:02:42,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775905450] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:42,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:42,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2022-01-10 01:02:42,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309160082] [2022-01-10 01:02:42,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:42,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 01:02:42,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 01:02:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-01-10 01:02:42,833 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-01-10 01:02:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:43,076 INFO L93 Difference]: Finished difference Result 241 states and 471 transitions. [2022-01-10 01:02:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 01:02:43,077 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 79 [2022-01-10 01:02:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:43,078 INFO L225 Difference]: With dead ends: 241 [2022-01-10 01:02:43,078 INFO L226 Difference]: Without dead ends: 120 [2022-01-10 01:02:43,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:02:43,080 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 81 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:43,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 213 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-10 01:02:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2022-01-10 01:02:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (52), 20 states have call predecessors, (52), 19 states have call successors, (52) [2022-01-10 01:02:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2022-01-10 01:02:43,090 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 79 [2022-01-10 01:02:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:43,090 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2022-01-10 01:02:43,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-01-10 01:02:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2022-01-10 01:02:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-10 01:02:43,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:43,094 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:43,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:43,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:43,307 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 502211684, now seen corresponding path program 2 times [2022-01-10 01:02:43,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:43,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299065252] [2022-01-10 01:02:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:43,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 01:02:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:02:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 140 proven. 160 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-01-10 01:02:43,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299065252] [2022-01-10 01:02:43,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299065252] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715152699] [2022-01-10 01:02:43,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:02:43,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:43,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:43,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 01:02:43,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 01:02:43,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:02:43,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 01:02:43,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 82 proven. 133 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-01-10 01:02:44,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 82 proven. 141 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-01-10 01:02:45,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715152699] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:45,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:45,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 13] total 32 [2022-01-10 01:02:45,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571585983] [2022-01-10 01:02:45,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:45,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 01:02:45,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 01:02:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2022-01-10 01:02:45,031 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 32 states have internal predecessors, (89), 20 states have call successors, (26), 1 states have call predecessors, (26), 14 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2022-01-10 01:02:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:45,640 INFO L93 Difference]: Finished difference Result 230 states and 432 transitions. [2022-01-10 01:02:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-10 01:02:45,641 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 32 states have internal predecessors, (89), 20 states have call successors, (26), 1 states have call predecessors, (26), 14 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 148 [2022-01-10 01:02:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:45,644 INFO L225 Difference]: With dead ends: 230 [2022-01-10 01:02:45,644 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 01:02:45,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-01-10 01:02:45,645 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:45,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 348 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:02:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 01:02:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-01-10 01:02:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 67 states have internal predecessors, (82), 17 states have call successors, (17), 11 states have call predecessors, (17), 12 states have return successors, (36), 17 states have call predecessors, (36), 17 states have call successors, (36) [2022-01-10 01:02:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2022-01-10 01:02:45,652 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 148 [2022-01-10 01:02:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:45,652 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2022-01-10 01:02:45,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.870967741935484) internal successors, (89), 32 states have internal predecessors, (89), 20 states have call successors, (26), 1 states have call predecessors, (26), 14 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2022-01-10 01:02:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2022-01-10 01:02:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 01:02:45,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:45,654 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:45,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:45,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:45,884 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 882144864, now seen corresponding path program 1 times [2022-01-10 01:02:45,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:45,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950126165] [2022-01-10 01:02:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:45,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:02:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-01-10 01:02:46,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:46,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950126165] [2022-01-10 01:02:46,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950126165] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:46,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358341302] [2022-01-10 01:02:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:46,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:46,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:46,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 01:02:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:02:46,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-01-10 01:02:46,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-01-10 01:02:46,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358341302] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:46,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:46,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 19 [2022-01-10 01:02:46,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311012855] [2022-01-10 01:02:46,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:46,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 01:02:46,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 01:02:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-01-10 01:02:46,656 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2022-01-10 01:02:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:46,864 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2022-01-10 01:02:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 01:02:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) Word has length 92 [2022-01-10 01:02:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:46,866 INFO L225 Difference]: With dead ends: 196 [2022-01-10 01:02:46,866 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 01:02:46,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-01-10 01:02:46,867 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:46,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 239 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 01:02:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-01-10 01:02:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 71 states have internal predecessors, (88), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (35), 18 states have call predecessors, (35), 18 states have call successors, (35) [2022-01-10 01:02:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2022-01-10 01:02:46,877 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 92 [2022-01-10 01:02:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:46,877 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2022-01-10 01:02:46,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2022-01-10 01:02:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2022-01-10 01:02:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 01:02:46,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:46,882 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:46,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:47,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 01:02:47,096 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash -574358487, now seen corresponding path program 2 times [2022-01-10 01:02:47,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:47,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151151817] [2022-01-10 01:02:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:47,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:02:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 58 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 01:02:47,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:47,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151151817] [2022-01-10 01:02:47,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151151817] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:47,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705630648] [2022-01-10 01:02:47,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:02:47,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:47,277 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:02:47,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 01:02:47,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 01:02:47,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:02:47,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:02:47,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-01-10 01:02:47,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 57 proven. 63 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 01:02:48,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705630648] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:48,044 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:48,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 11] total 24 [2022-01-10 01:02:48,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806361692] [2022-01-10 01:02:48,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:48,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 01:02:48,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 01:02:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2022-01-10 01:02:48,046 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 15 states have call predecessors, (27), 15 states have call successors, (27) [2022-01-10 01:02:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:48,263 INFO L93 Difference]: Finished difference Result 206 states and 292 transitions. [2022-01-10 01:02:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 01:02:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 15 states have call predecessors, (27), 15 states have call successors, (27) Word has length 107 [2022-01-10 01:02:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:48,264 INFO L225 Difference]: With dead ends: 206 [2022-01-10 01:02:48,265 INFO L226 Difference]: Without dead ends: 113 [2022-01-10 01:02:48,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-01-10 01:02:48,266 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:48,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 196 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-10 01:02:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2022-01-10 01:02:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 18 states have call successors, (18), 13 states have call predecessors, (18), 11 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) [2022-01-10 01:02:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2022-01-10 01:02:48,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 107 [2022-01-10 01:02:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:48,271 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2022-01-10 01:02:48,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 15 states have call predecessors, (27), 15 states have call successors, (27) [2022-01-10 01:02:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2022-01-10 01:02:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 01:02:48,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:48,272 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:48,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:48,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:48,489 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2118534433, now seen corresponding path program 3 times [2022-01-10 01:02:48,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:48,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255418265] [2022-01-10 01:02:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:48,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:02:48,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 01:02:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:02:48,531 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 01:02:48,532 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 01:02:48,532 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:02:48,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 01:02:48,537 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:48,539 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:02:48,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:02:48 BoogieIcfgContainer [2022-01-10 01:02:48,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:02:48,593 INFO L158 Benchmark]: Toolchain (without parser) took 11940.16ms. Allocated memory was 179.3MB in the beginning and 268.4MB in the end (delta: 89.1MB). Free memory was 125.5MB in the beginning and 180.0MB in the end (delta: -54.5MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2022-01-10 01:02:48,594 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:02:48,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.07ms. Allocated memory was 179.3MB in the beginning and 223.3MB in the end (delta: 44.0MB). Free memory was 125.3MB in the beginning and 198.9MB in the end (delta: -73.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-01-10 01:02:48,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.15ms. Allocated memory is still 223.3MB. Free memory was 198.9MB in the beginning and 197.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:02:48,594 INFO L158 Benchmark]: Boogie Preprocessor took 20.71ms. Allocated memory is still 223.3MB. Free memory was 197.5MB in the beginning and 196.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:02:48,594 INFO L158 Benchmark]: RCFGBuilder took 265.43ms. Allocated memory is still 223.3MB. Free memory was 196.4MB in the beginning and 186.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 01:02:48,595 INFO L158 Benchmark]: TraceAbstraction took 11331.50ms. Allocated memory was 223.3MB in the beginning and 268.4MB in the end (delta: 45.1MB). Free memory was 186.5MB in the beginning and 180.0MB in the end (delta: 6.5MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2022-01-10 01:02:48,596 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.07ms. Allocated memory was 179.3MB in the beginning and 223.3MB in the end (delta: 44.0MB). Free memory was 125.3MB in the beginning and 198.9MB in the end (delta: -73.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.15ms. Allocated memory is still 223.3MB. Free memory was 198.9MB in the beginning and 197.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.71ms. Allocated memory is still 223.3MB. Free memory was 197.5MB in the beginning and 196.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.43ms. Allocated memory is still 223.3MB. Free memory was 196.4MB in the beginning and 186.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11331.50ms. Allocated memory was 223.3MB in the beginning and 268.4MB in the end (delta: 45.1MB). Free memory was 186.5MB in the beginning and 180.0MB in the end (delta: 6.5MB). Peak memory consumption was 52.6MB. 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 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L39] int result = fibo1(x); [L40] COND TRUE result == 5 VAL [result=5, x=5] [L41] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 2097 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1793 mSDsCounter, 748 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2911 IncrementalHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 748 mSolverCounterUnsat, 304 mSDtfsCounter, 2911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1543 GetRequests, 1300 SyntacticMatches, 17 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 125 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1321 NumberOfCodeBlocks, 1321 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 3528 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1539 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 2771/3702 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 proved your program to be incorrect! [2022-01-10 01:02:48,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...