/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/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 22:23:50,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 22:23:50,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 22:23:50,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 22:23:50,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 22:23:50,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 22:23:50,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 22:23:50,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 22:23:50,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 22:23:50,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 22:23:50,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 22:23:50,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 22:23:50,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 22:23:50,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 22:23:50,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 22:23:50,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 22:23:50,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 22:23:50,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 22:23:50,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 22:23:50,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 22:23:50,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 22:23:50,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 22:23:50,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 22:23:50,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 22:23:50,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 22:23:50,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 22:23:50,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 22:23:50,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 22:23:50,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 22:23:50,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 22:23:50,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 22:23:50,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 22:23:50,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 22:23:50,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 22:23:50,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 22:23:50,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 22:23:50,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 22:23:50,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 22:23:50,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 22:23:50,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 22:23:50,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 22:23:50,870 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-09 22:23:50,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 22:23:50,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 22:23:50,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 22:23:50,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 22:23:50,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 22:23:50,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 22:23:50,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 22:23:50,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 22:23:50,909 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 22:23:50,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 22:23:50,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 22:23:50,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 22:23:50,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 22:23:50,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 22:23:50,912 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-09 22:23:51,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 22:23:51,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 22:23:51,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 22:23:51,198 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 22:23:51,200 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 22:23:51,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-01-09 22:23:51,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d09becf2/e79dc6f50eb74c649897e4b57deeed16/FLAGa45ffcf76 [2022-01-09 22:23:51,642 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 22:23:51,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2022-01-09 22:23:51,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d09becf2/e79dc6f50eb74c649897e4b57deeed16/FLAGa45ffcf76 [2022-01-09 22:23:52,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d09becf2/e79dc6f50eb74c649897e4b57deeed16 [2022-01-09 22:23:52,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 22:23:52,042 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 22:23:52,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 22:23:52,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 22:23:52,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 22:23:52,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbc404f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52, skipping insertion in model container [2022-01-09 22:23:52,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 22:23:52,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 22:23:52,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-01-09 22:23:52,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 22:23:52,247 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 22:23:52,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2022-01-09 22:23:52,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 22:23:52,275 INFO L208 MainTranslator]: Completed translation [2022-01-09 22:23:52,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52 WrapperNode [2022-01-09 22:23:52,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 22:23:52,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 22:23:52,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 22:23:52,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 22:23:52,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,319 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2022-01-09 22:23:52,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 22:23:52,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 22:23:52,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 22:23:52,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 22:23:52,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 22:23:52,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 22:23:52,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 22:23:52,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 22:23:52,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (1/1) ... [2022-01-09 22:23:52,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 22:23:52,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:52,380 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-09 22:23:52,388 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-09 22:23:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 22:23:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 22:23:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 22:23:52,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 22:23:52,454 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 22:23:52,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 22:23:52,642 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 22:23:52,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 22:23:52,647 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-09 22:23:52,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:52 BoogieIcfgContainer [2022-01-09 22:23:52,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 22:23:52,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 22:23:52,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 22:23:52,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 22:23:52,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:23:52" (1/3) ... [2022-01-09 22:23:52,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d27f2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:52, skipping insertion in model container [2022-01-09 22:23:52,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:52" (2/3) ... [2022-01-09 22:23:52,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d27f2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:52, skipping insertion in model container [2022-01-09 22:23:52,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:52" (3/3) ... [2022-01-09 22:23:52,667 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2022-01-09 22:23:52,670 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 22:23:52,670 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 22:23:52,716 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 22:23:52,720 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-09 22:23:52,720 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 22:23:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:52,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:52,737 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:52,738 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:52,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1745867070, now seen corresponding path program 1 times [2022-01-09 22:23:52,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:52,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012595615] [2022-01-09 22:23:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:52,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:52,874 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-09 22:23:52,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:52,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012595615] [2022-01-09 22:23:52,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012595615] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:52,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:52,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 22:23:52,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099995531] [2022-01-09 22:23:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:52,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 22:23:52,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 22:23:52,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:23:52,900 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:52,957 INFO L93 Difference]: Finished difference Result 52 states and 90 transitions. [2022-01-09 22:23:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 22:23:52,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:52,969 INFO L225 Difference]: With dead ends: 52 [2022-01-09 22:23:52,969 INFO L226 Difference]: Without dead ends: 25 [2022-01-09 22:23:52,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:23:52,977 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:52,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-09 22:23:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-09 22:23:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-01-09 22:23:53,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2022-01-09 22:23:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,003 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-01-09 22:23:53,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-01-09 22:23:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:53,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,003 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 22:23:53,004 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -936932661, now seen corresponding path program 1 times [2022-01-09 22:23:53,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225835407] [2022-01-09 22:23:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,032 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-09 22:23:53,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225835407] [2022-01-09 22:23:53,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225835407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 22:23:53,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914669396] [2022-01-09 22:23:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:23:53,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:23:53,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 22:23:53,035 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,067 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-01-09 22:23:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:23:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,068 INFO L225 Difference]: With dead ends: 44 [2022-01-09 22:23:53,068 INFO L226 Difference]: Without dead ends: 25 [2022-01-09 22:23:53,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 22:23:53,069 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-09 22:23:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-09 22:23:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-01-09 22:23:53,073 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 23 [2022-01-09 22:23:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,073 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-01-09 22:23:53,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-01-09 22:23:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:53,074 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,074 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 22:23:53,074 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2008089875, now seen corresponding path program 1 times [2022-01-09 22:23:53,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535729500] [2022-01-09 22:23:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,100 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-09 22:23:53,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535729500] [2022-01-09 22:23:53,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535729500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 22:23:53,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682094698] [2022-01-09 22:23:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 22:23:53,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 22:23:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:23:53,102 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,184 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2022-01-09 22:23:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 22:23:53,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,185 INFO L225 Difference]: With dead ends: 54 [2022-01-09 22:23:53,186 INFO L226 Difference]: Without dead ends: 39 [2022-01-09 22:23:53,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:23:53,187 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-09 22:23:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-01-09 22:23:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-01-09 22:23:53,202 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 23 [2022-01-09 22:23:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,202 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-01-09 22:23:53,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-01-09 22:23:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:53,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,203 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 22:23:53,204 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash 635511084, now seen corresponding path program 1 times [2022-01-09 22:23:53,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087761253] [2022-01-09 22:23:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,252 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-09 22:23:53,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087761253] [2022-01-09 22:23:53,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087761253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 22:23:53,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488570608] [2022-01-09 22:23:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 22:23:53,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 22:23:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:23:53,254 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,285 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-01-09 22:23:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 22:23:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,286 INFO L225 Difference]: With dead ends: 52 [2022-01-09 22:23:53,286 INFO L226 Difference]: Without dead ends: 35 [2022-01-09 22:23:53,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:23:53,287 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 26 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-09 22:23:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-09 22:23:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-01-09 22:23:53,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 23 [2022-01-09 22:23:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,291 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-01-09 22:23:53,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-01-09 22:23:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:53,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,292 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 22:23:53,292 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 602818777, now seen corresponding path program 1 times [2022-01-09 22:23:53,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858866208] [2022-01-09 22:23:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,348 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-09 22:23:53,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858866208] [2022-01-09 22:23:53,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858866208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-09 22:23:53,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832134090] [2022-01-09 22:23:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 22:23:53,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 22:23:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:23:53,350 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,402 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-01-09 22:23:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 22:23:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,403 INFO L225 Difference]: With dead ends: 44 [2022-01-09 22:23:53,403 INFO L226 Difference]: Without dead ends: 31 [2022-01-09 22:23:53,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:23:53,404 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-09 22:23:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-09 22:23:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-01-09 22:23:53,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2022-01-09 22:23:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,408 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-01-09 22:23:53,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-01-09 22:23:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:53,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,409 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 22:23:53,409 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash -218545361, now seen corresponding path program 1 times [2022-01-09 22:23:53,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178756719] [2022-01-09 22:23:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,434 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-09 22:23:53,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178756719] [2022-01-09 22:23:53,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178756719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 22:23:53,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365279266] [2022-01-09 22:23:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 22:23:53,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 22:23:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:23:53,436 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,463 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-01-09 22:23:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 22:23:53,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,464 INFO L225 Difference]: With dead ends: 34 [2022-01-09 22:23:53,464 INFO L226 Difference]: Without dead ends: 31 [2022-01-09 22:23:53,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:23:53,465 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-09 22:23:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-09 22:23:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-01-09 22:23:53,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2022-01-09 22:23:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,468 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-01-09 22:23:53,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-01-09 22:23:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 22:23:53,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,469 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 22:23:53,469 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash -217919750, now seen corresponding path program 1 times [2022-01-09 22:23:53,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443995882] [2022-01-09 22:23:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,546 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-09 22:23:53,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443995882] [2022-01-09 22:23:53,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443995882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-09 22:23:53,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833524311] [2022-01-09 22:23:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 22:23:53,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 22:23:53,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-01-09 22:23:53,548 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,594 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-01-09 22:23:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 22:23:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-09 22:23:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,596 INFO L225 Difference]: With dead ends: 36 [2022-01-09 22:23:53,596 INFO L226 Difference]: Without dead ends: 27 [2022-01-09 22:23:53,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-01-09 22:23:53,599 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-09 22:23:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-09 22:23:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-01-09 22:23:53,605 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2022-01-09 22:23:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,605 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-01-09 22:23:53,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-01-09 22:23:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-09 22:23:53,605 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,605 INFO L514 BasicCegarLoop]: trace histogram [1, 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-09 22:23:53,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 22:23:53,606 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash 423767145, now seen corresponding path program 1 times [2022-01-09 22:23:53,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619399532] [2022-01-09 22:23:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:53,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619399532] [2022-01-09 22:23:53,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619399532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:23:53,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:23:53,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-09 22:23:53,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081458687] [2022-01-09 22:23:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:23:53,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-09 22:23:53,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:53,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-09 22:23:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-01-09 22:23:53,716 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:53,758 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-01-09 22:23:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 22:23:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-09 22:23:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:53,760 INFO L225 Difference]: With dead ends: 34 [2022-01-09 22:23:53,760 INFO L226 Difference]: Without dead ends: 29 [2022-01-09 22:23:53,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-01-09 22:23:53,761 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:53,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:23:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-09 22:23:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-09 22:23:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-01-09 22:23:53,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2022-01-09 22:23:53,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:53,766 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-01-09 22:23:53,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-01-09 22:23:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-09 22:23:53,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:53,767 INFO L514 BasicCegarLoop]: trace histogram [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-09 22:23:53,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 22:23:53,767 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -875092666, now seen corresponding path program 1 times [2022-01-09 22:23:53,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193987914] [2022-01-09 22:23:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:53,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:53,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193987914] [2022-01-09 22:23:53,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193987914] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:53,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328867583] [2022-01-09 22:23:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:53,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:53,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:53,875 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-09 22:23:53,890 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-09 22:23:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:53,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-09 22:23:53,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:54,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:54,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328867583] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:54,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:54,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-01-09 22:23:54,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373794412] [2022-01-09 22:23:54,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:54,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-09 22:23:54,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-09 22:23:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-01-09 22:23:54,306 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:54,430 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-01-09 22:23:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-09 22:23:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-09 22:23:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:54,431 INFO L225 Difference]: With dead ends: 58 [2022-01-09 22:23:54,431 INFO L226 Difference]: Without dead ends: 53 [2022-01-09 22:23:54,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-01-09 22:23:54,431 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:54,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 18 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-09 22:23:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-09 22:23:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-01-09 22:23:54,435 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 27 [2022-01-09 22:23:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:54,435 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-01-09 22:23:54,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-01-09 22:23:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-09 22:23:54,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:54,436 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 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-09 22:23:54,468 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-09 22:23:54,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:54,667 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1668395554, now seen corresponding path program 2 times [2022-01-09 22:23:54,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:54,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336169485] [2022-01-09 22:23:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:54,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:55,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336169485] [2022-01-09 22:23:55,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336169485] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588281720] [2022-01-09 22:23:55,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 22:23:55,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:55,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:55,020 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-09 22:23:55,021 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-09 22:23:55,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 22:23:55,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:23:55,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-09 22:23:55,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:55,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:55,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588281720] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:55,832 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:55,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-01-09 22:23:55,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040207271] [2022-01-09 22:23:55,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:55,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-09 22:23:55,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-09 22:23:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-01-09 22:23:55,835 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:55,988 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-01-09 22:23:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-09 22:23:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-09 22:23:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:55,993 INFO L225 Difference]: With dead ends: 106 [2022-01-09 22:23:55,993 INFO L226 Difference]: Without dead ends: 101 [2022-01-09 22:23:55,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-01-09 22:23:55,994 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 99 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:55,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 18 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-09 22:23:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-01-09 22:23:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-01-09 22:23:55,999 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 51 [2022-01-09 22:23:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:56,000 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-01-09 22:23:56,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-01-09 22:23:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-09 22:23:56,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:56,001 INFO L514 BasicCegarLoop]: trace histogram [38, 37, 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-09 22:23:56,019 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-09 22:23:56,219 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,SelfDestructingSolverStorable9 [2022-01-09 22:23:56,220 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1723682778, now seen corresponding path program 3 times [2022-01-09 22:23:56,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388296063] [2022-01-09 22:23:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:56,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:23:57,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388296063] [2022-01-09 22:23:57,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388296063] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535146760] [2022-01-09 22:23:57,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 22:23:57,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:57,123 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-09 22:23:57,153 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-09 22:23:57,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-09 22:23:57,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:23:57,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-09 22:23:57,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2022-01-09 22:23:57,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2022-01-09 22:23:57,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535146760] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:57,480 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:57,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 4, 4] total 53 [2022-01-09 22:23:57,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489753807] [2022-01-09 22:23:57,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:57,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-09 22:23:57,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-09 22:23:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-01-09 22:23:57,482 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 53 states, 53 states have (on average 2.4150943396226414) internal successors, (128), 53 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:57,622 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2022-01-09 22:23:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-09 22:23:57,623 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.4150943396226414) internal successors, (128), 53 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-09 22:23:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:57,624 INFO L225 Difference]: With dead ends: 113 [2022-01-09 22:23:57,624 INFO L226 Difference]: Without dead ends: 108 [2022-01-09 22:23:57,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-01-09 22:23:57,625 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 111 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:57,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 23 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-09 22:23:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-01-09 22:23:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-01-09 22:23:57,631 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 99 [2022-01-09 22:23:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:57,632 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-01-09 22:23:57,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.4150943396226414) internal successors, (128), 53 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-01-09 22:23:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-09 22:23:57,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:57,633 INFO L514 BasicCegarLoop]: trace histogram [42, 38, 4, 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-09 22:23:57,661 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-09 22:23:57,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:57,852 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -640925019, now seen corresponding path program 4 times [2022-01-09 22:23:57,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:57,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212555541] [2022-01-09 22:23:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:57,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:23:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 22:23:58,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:23:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212555541] [2022-01-09 22:23:58,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212555541] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:23:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675318433] [2022-01-09 22:23:58,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 22:23:58,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:23:58,716 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-09 22:23:58,760 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-09 22:23:58,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 22:23:58,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:23:58,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-09 22:23:58,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:23:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 22:23:58,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:23:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 22:23:59,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675318433] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:23:59,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:23:59,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 53 [2022-01-09 22:23:59,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619037133] [2022-01-09 22:23:59,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:23:59,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-09 22:23:59,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:23:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-09 22:23:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-01-09 22:23:59,254 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:23:59,357 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-01-09 22:23:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-09 22:23:59,357 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-09 22:23:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:23:59,358 INFO L225 Difference]: With dead ends: 124 [2022-01-09 22:23:59,358 INFO L226 Difference]: Without dead ends: 114 [2022-01-09 22:23:59,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-01-09 22:23:59,359 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:23:59,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:23:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-09 22:23:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-01-09 22:23:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2022-01-09 22:23:59,365 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 107 [2022-01-09 22:23:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:23:59,365 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2022-01-09 22:23:59,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.452830188679245) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:23:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-01-09 22:23:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-09 22:23:59,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:23:59,366 INFO L514 BasicCegarLoop]: trace histogram [45, 41, 4, 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-09 22:23:59,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 22:23:59,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:23:59,583 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:23:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:23:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1058630724, now seen corresponding path program 5 times [2022-01-09 22:23:59,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:23:59,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361141452] [2022-01-09 22:23:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:23:59,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:23:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:24:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:24:00,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:24:00,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361141452] [2022-01-09 22:24:00,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361141452] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:24:00,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830025098] [2022-01-09 22:24:00,613 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-09 22:24:00,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:24:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:24:00,628 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-09 22:24:00,629 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-09 22:24:00,684 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2022-01-09 22:24:00,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:24:00,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-09 22:24:00,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:24:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-01-09 22:24:01,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:24:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-01-09 22:24:02,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830025098] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:24:02,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:24:02,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 25, 25] total 98 [2022-01-09 22:24:02,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589541436] [2022-01-09 22:24:02,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:24:02,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-01-09 22:24:02,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:24:02,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-01-09 22:24:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2022-01-09 22:24:02,672 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand has 98 states, 98 states have (on average 2.2653061224489797) internal successors, (222), 98 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:24:02,967 INFO L93 Difference]: Finished difference Result 201 states and 243 transitions. [2022-01-09 22:24:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-01-09 22:24:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.2653061224489797) internal successors, (222), 98 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-09 22:24:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:24:02,968 INFO L225 Difference]: With dead ends: 201 [2022-01-09 22:24:02,968 INFO L226 Difference]: Without dead ends: 198 [2022-01-09 22:24:02,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2022-01-09 22:24:02,971 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 155 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:24:02,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 17 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:24:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-09 22:24:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-01-09 22:24:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.0101522842639594) internal successors, (199), 197 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2022-01-09 22:24:02,978 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 113 [2022-01-09 22:24:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:24:02,978 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2022-01-09 22:24:02,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.2653061224489797) internal successors, (222), 98 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2022-01-09 22:24:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-09 22:24:02,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:24:02,980 INFO L514 BasicCegarLoop]: trace histogram [87, 46, 41, 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-09 22:24:02,996 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-09 22:24:03,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-09 22:24:03,196 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:24:03,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:24:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1561171392, now seen corresponding path program 6 times [2022-01-09 22:24:03,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:24:03,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696332696] [2022-01-09 22:24:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:24:03,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:24:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:24:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:24:05,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:24:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696332696] [2022-01-09 22:24:05,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696332696] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:24:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185786095] [2022-01-09 22:24:05,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-09 22:24:05,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:24:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:24:05,583 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-09 22:24:05,584 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-09 22:24:05,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2022-01-09 22:24:05,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 22:24:05,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-09 22:24:05,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:24:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2022-01-09 22:24:05,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:24:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2022-01-09 22:24:06,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185786095] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:24:06,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:24:06,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 49, 49] total 102 [2022-01-09 22:24:06,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628652608] [2022-01-09 22:24:06,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:24:06,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-01-09 22:24:06,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:24:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-01-09 22:24:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2022-01-09 22:24:06,444 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand has 102 states, 102 states have (on average 2.2254901960784315) internal successors, (227), 102 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:24:06,796 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2022-01-09 22:24:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-09 22:24:06,797 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.2254901960784315) internal successors, (227), 102 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2022-01-09 22:24:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:24:06,798 INFO L225 Difference]: With dead ends: 209 [2022-01-09 22:24:06,798 INFO L226 Difference]: Without dead ends: 206 [2022-01-09 22:24:06,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2022-01-09 22:24:06,801 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 138 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:24:06,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 23 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:24:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-01-09 22:24:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-01-09 22:24:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.0097560975609756) internal successors, (207), 205 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2022-01-09 22:24:06,827 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 197 [2022-01-09 22:24:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:24:06,828 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2022-01-09 22:24:06,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.2254901960784315) internal successors, (227), 102 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2022-01-09 22:24:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-09 22:24:06,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:24:06,829 INFO L514 BasicCegarLoop]: trace histogram [91, 50, 41, 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-09 22:24:06,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-09 22:24:07,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:24:07,030 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:24:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:24:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 782272296, now seen corresponding path program 7 times [2022-01-09 22:24:07,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:24:07,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038449468] [2022-01-09 22:24:07,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:24:07,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:24:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:24:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-01-09 22:24:08,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:24:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038449468] [2022-01-09 22:24:08,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038449468] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:24:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954034214] [2022-01-09 22:24:08,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-09 22:24:08,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:24:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:24:08,309 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-09 22:24:08,310 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-09 22:24:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:24:08,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 105 conjunts are in the unsatisfiable core [2022-01-09 22:24:08,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:24:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-01-09 22:24:09,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:24:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-01-09 22:24:10,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954034214] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:24:10,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:24:10,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2022-01-09 22:24:10,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802296296] [2022-01-09 22:24:10,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:24:10,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-09 22:24:10,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:24:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-09 22:24:10,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2022-01-09 22:24:10,072 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand has 55 states, 55 states have (on average 2.290909090909091) internal successors, (126), 55 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:24:10,986 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2022-01-09 22:24:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-09 22:24:10,987 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.290909090909091) internal successors, (126), 55 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-01-09 22:24:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:24:10,987 INFO L225 Difference]: With dead ends: 212 [2022-01-09 22:24:10,987 INFO L226 Difference]: Without dead ends: 209 [2022-01-09 22:24:10,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 404 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2022-01-09 22:24:10,988 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-09 22:24:10,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 3871 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-09 22:24:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-09 22:24:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2022-01-09 22:24:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.0096618357487923) internal successors, (209), 207 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2022-01-09 22:24:10,994 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2022-01-09 22:24:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:24:10,994 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2022-01-09 22:24:10,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.290909090909091) internal successors, (126), 55 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2022-01-09 22:24:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-09 22:24:10,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:24:10,996 INFO L514 BasicCegarLoop]: trace histogram [92, 51, 41, 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-09 22:24:11,029 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-09 22:24:11,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:24:11,208 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:24:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:24:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash 136861218, now seen corresponding path program 8 times [2022-01-09 22:24:11,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:24:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779237528] [2022-01-09 22:24:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:24:11,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:24:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:24:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-01-09 22:24:12,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:24:12,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779237528] [2022-01-09 22:24:12,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779237528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:24:12,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:24:12,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-01-09 22:24:12,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191382871] [2022-01-09 22:24:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:24:12,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-09 22:24:12,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:24:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-09 22:24:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-01-09 22:24:12,136 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:24:12,339 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2022-01-09 22:24:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-09 22:24:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2022-01-09 22:24:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:24:12,340 INFO L225 Difference]: With dead ends: 208 [2022-01-09 22:24:12,340 INFO L226 Difference]: Without dead ends: 0 [2022-01-09 22:24:12,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-01-09 22:24:12,342 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:24:12,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:24:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-09 22:24:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-09 22:24:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-09 22:24:12,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-01-09 22:24:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:24:12,345 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-09 22:24:12,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 22:24:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-09 22:24:12,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-09 22:24:12,347 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 22:24:12,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-09 22:24:12,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-09 22:24:13,523 INFO L854 garLoopResultBuilder]: At program point L159(lines 43 160) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 5) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-01-09 22:24:13,523 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 208) no Hoare annotation was computed. [2022-01-09 22:24:13,523 INFO L854 garLoopResultBuilder]: At program point L135(lines 55 136) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 7)) [2022-01-09 22:24:13,523 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 103) no Hoare annotation was computed. [2022-01-09 22:24:13,523 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-09 22:24:13,523 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 124) no Hoare annotation was computed. [2022-01-09 22:24:13,523 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-09 22:24:13,524 INFO L854 garLoopResultBuilder]: At program point L111(lines 67 112) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_~main__x~0#1| 86) (<= 86 |ULTIMATE.start_main_~main__x~0#1|) (<= 86 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 86)) (and (<= 70 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 70) (<= |ULTIMATE.start_main_~main__x~0#1| 70) (<= 70 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= 94 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 94) (<= 94 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 94)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 75) (<= 75 |ULTIMATE.start_main_~main__x~0#1|) (<= 75 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 75)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) (<= |ULTIMATE.start_main_~main__x~0#1| 55) (<= 55 |ULTIMATE.start_main_~main__y~0#1|) (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 80) (<= 80 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 80) (<= 80 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 64) (<= 64 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 64)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 58) (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) (<= 58 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= 99 |ULTIMATE.start_main_~main__y~0#1|) (<= 99 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 99) (< |ULTIMATE.start_main_~main__x~0#1| 100)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 81) (<= |ULTIMATE.start_main_~main__x~0#1| 81) (<= 81 |ULTIMATE.start_main_~main__x~0#1|) (<= 81 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 50) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 74) (<= 74 |ULTIMATE.start_main_~main__x~0#1|) (<= 74 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 74)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__y~0#1|) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 62)) (and (<= 92 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 92) (<= 92 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 92)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 90) (<= |ULTIMATE.start_main_~main__y~0#1| 90) (<= 90 |ULTIMATE.start_main_~main__y~0#1|) (<= 90 |ULTIMATE.start_main_~main__x~0#1|)) (and (< 99 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 100) (<= 100 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 71 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 71) (<= 71 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 71)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 89) (<= 89 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 89) (<= 89 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 82) (<= 82 |ULTIMATE.start_main_~main__y~0#1|) (<= 82 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 82)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 57) (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) (<= 57 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= 77 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 77) (<= 77 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 77)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 93) (<= 93 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 93) (<= 93 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 69) (<= 69 |ULTIMATE.start_main_~main__y~0#1|) (<= 69 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 69)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 68) (<= 68 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 68) (<= 68 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 72 |ULTIMATE.start_main_~main__y~0#1|) (<= 72 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 72) (<= |ULTIMATE.start_main_~main__x~0#1| 72)) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 56) (<= 56 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 73) (<= 73 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 73) (<= 73 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 52) (<= 52 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 52) (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 88 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 88) (<= 88 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 88)) (and (<= 65 |ULTIMATE.start_main_~main__y~0#1|) (<= 65 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 65) (<= |ULTIMATE.start_main_~main__x~0#1| 65)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 84 |ULTIMATE.start_main_~main__y~0#1|) (<= 84 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 84) (<= |ULTIMATE.start_main_~main__y~0#1| 84)) (and (<= 67 |ULTIMATE.start_main_~main__y~0#1|) (<= 67 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 67) (<= |ULTIMATE.start_main_~main__y~0#1| 67)) (and (<= 51 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 51) (<= 51 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 51)) (and (<= 83 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 83) (<= |ULTIMATE.start_main_~main__x~0#1| 83) (<= 83 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 85 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 85) (<= 85 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 85)) (and (< |ULTIMATE.start_main_~main__x~0#1| 99) (<= 98 |ULTIMATE.start_main_~main__x~0#1|) (<= 98 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 98)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 97) (< |ULTIMATE.start_main_~main__x~0#1| 98) (<= 97 |ULTIMATE.start_main_~main__y~0#1|) (<= 97 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 79 |ULTIMATE.start_main_~main__x~0#1|) (<= 79 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 79) (<= |ULTIMATE.start_main_~main__y~0#1| 79)) (and (<= 63 |ULTIMATE.start_main_~main__y~0#1|) (<= 63 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 63) (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 66) (<= |ULTIMATE.start_main_~main__y~0#1| 66) (<= 66 |ULTIMATE.start_main_~main__y~0#1|) (<= 66 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 61 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 61) (<= 61 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 78) (<= 78 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 78) (<= 78 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 87) (<= 87 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 87) (<= 87 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 91 |ULTIMATE.start_main_~main__x~0#1|) (<= 91 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 91) (<= |ULTIMATE.start_main_~main__y~0#1| 91)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 96) (<= |ULTIMATE.start_main_~main__y~0#1| 96) (<= 96 |ULTIMATE.start_main_~main__y~0#1|) (<= 96 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) (<= |ULTIMATE.start_main_~main__x~0#1| 54) (<= 54 |ULTIMATE.start_main_~main__y~0#1|) (<= 54 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 76) (<= 76 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 76) (<= 76 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= |ULTIMATE.start_main_~main__x~0#1| 95) (<= 95 |ULTIMATE.start_main_~main__x~0#1|) (<= 95 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 95))) [2022-01-09 22:24:13,524 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 172) no Hoare annotation was computed. [2022-01-09 22:24:13,524 INFO L854 garLoopResultBuilder]: At program point L195(lines 25 196) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 2) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-01-09 22:24:13,524 INFO L858 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2022-01-09 22:24:13,524 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 136) no Hoare annotation was computed. [2022-01-09 22:24:13,524 INFO L861 garLoopResultBuilder]: At program point L212(lines 13 214) the Hoare annotation is: true [2022-01-09 22:24:13,524 INFO L854 garLoopResultBuilder]: At program point L171(lines 37 172) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 4) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-01-09 22:24:13,524 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 184) no Hoare annotation was computed. [2022-01-09 22:24:13,524 INFO L854 garLoopResultBuilder]: At program point L147(lines 49 148) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 6)) [2022-01-09 22:24:13,524 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-09 22:24:13,524 INFO L854 garLoopResultBuilder]: At program point L123(lines 61 124) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 8) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 96) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 148) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 85) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 196) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 213) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L854 garLoopResultBuilder]: At program point L207(lines 19 208) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 1)) [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 112) no Hoare annotation was computed. [2022-01-09 22:24:13,525 INFO L854 garLoopResultBuilder]: At program point L183(lines 31 184) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 3)) [2022-01-09 22:24:13,525 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 160) no Hoare annotation was computed. [2022-01-09 22:24:13,527 INFO L732 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:24:13,528 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 22:24:13,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:24:13 BoogieIcfgContainer [2022-01-09 22:24:13,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 22:24:13,551 INFO L158 Benchmark]: Toolchain (without parser) took 21508.68ms. Allocated memory was 213.9MB in the beginning and 370.1MB in the end (delta: 156.2MB). Free memory was 164.1MB in the beginning and 166.2MB in the end (delta: -2.1MB). Peak memory consumption was 187.4MB. Max. memory is 8.0GB. [2022-01-09 22:24:13,551 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 213.9MB. Free memory was 180.2MB in the beginning and 180.0MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 22:24:13,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.22ms. Allocated memory is still 213.9MB. Free memory was 163.8MB in the beginning and 188.7MB in the end (delta: -24.9MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-01-09 22:24:13,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.36ms. Allocated memory is still 213.9MB. Free memory was 188.7MB in the beginning and 187.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 22:24:13,552 INFO L158 Benchmark]: Boogie Preprocessor took 25.61ms. Allocated memory is still 213.9MB. Free memory was 187.2MB in the beginning and 186.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 22:24:13,552 INFO L158 Benchmark]: RCFGBuilder took 302.06ms. Allocated memory is still 213.9MB. Free memory was 186.1MB in the beginning and 174.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-09 22:24:13,552 INFO L158 Benchmark]: TraceAbstraction took 20900.81ms. Allocated memory was 213.9MB in the beginning and 370.1MB in the end (delta: 156.2MB). Free memory was 174.1MB in the beginning and 166.2MB in the end (delta: 7.9MB). Peak memory consumption was 197.7MB. Max. memory is 8.0GB. [2022-01-09 22:24:13,553 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 213.9MB. Free memory was 180.2MB in the beginning and 180.0MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.22ms. Allocated memory is still 213.9MB. Free memory was 163.8MB in the beginning and 188.7MB in the end (delta: -24.9MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.36ms. Allocated memory is still 213.9MB. Free memory was 188.7MB in the beginning and 187.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.61ms. Allocated memory is still 213.9MB. Free memory was 187.2MB in the beginning and 186.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 302.06ms. Allocated memory is still 213.9MB. Free memory was 186.1MB in the beginning and 174.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20900.81ms. Allocated memory was 213.9MB in the beginning and 370.1MB in the end (delta: 156.2MB). Free memory was 174.1MB in the beginning and 166.2MB in the end (delta: 7.9MB). Peak memory consumption was 197.7MB. 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 - PositiveResult [Line: 96]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 16, TraceHistogramMax: 92, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 674 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 4206 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3925 mSDsCounter, 935 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4778 IncrementalHoareTripleChecker+Invalid, 5713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 935 mSolverCounterUnsat, 281 mSDtfsCounter, 4778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2034 GetRequests, 1519 SyntacticMatches, 9 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=15, InterpolantAutomatonStates: 533, 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, 16 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 111 NumberOfFragments, 739 HoareAnnotationTreeSize, 10 FomulaSimplifications, 492 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 410 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 1991 NumberOfCodeBlocks, 1919 NumberOfCodeBlocksAsserted, 159 NumberOfCheckSat, 2760 ConstructedInterpolants, 0 QuantifiedInterpolants, 9057 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1885 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 31437/72314 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main__x <= 86 && 86 <= main__x) && 86 <= main__y) && main__y <= 86) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((94 <= main__y && main__y <= 94) && 94 <= main__x) && main__x <= 94)) || (((main__x <= 75 && 75 <= main__x) && 75 <= main__y) && main__y <= 75)) || (((main__y <= 55 && main__x <= 55) && 55 <= main__y) && 55 <= main__x)) || (((main__x <= 80 && 80 <= main__x) && main__y <= 80) && 80 <= main__y)) || (((64 <= main__x && main__y <= 64) && 64 <= main__y) && main__x <= 64)) || (((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y)) || (((99 <= main__y && 99 <= main__x) && main__y <= 99) && main__x < 100)) || (((main__y <= 81 && main__x <= 81) && 81 <= main__x) && 81 <= main__y)) || ((main__x <= 50 && main__y <= 50) && 50 <= main__y)) || (((main__y <= 74 && 74 <= main__x) && 74 <= main__y) && main__x <= 74)) || (((main__y <= 62 && 62 <= main__y) && 62 <= main__x) && main__x <= 62)) || (((92 <= main__y && main__x <= 92) && 92 <= main__x) && main__y <= 92)) || (((main__x <= 90 && main__y <= 90) && 90 <= main__y) && 90 <= main__x)) || ((99 < main__y && main__y <= 100) && 100 <= main__x)) || (((71 <= main__x && main__y <= 71) && 71 <= main__y) && main__x <= 71)) || (((main__y <= 89 && 89 <= main__y) && main__x <= 89) && 89 <= main__x)) || (((main__y <= 82 && 82 <= main__y) && 82 <= main__x) && main__x <= 82)) || (((main__x <= 57 && main__y <= 57) && 57 <= main__x) && 57 <= main__y)) || (((77 <= main__x && main__y <= 77) && 77 <= main__y) && main__x <= 77)) || (((main__y <= 93 && 93 <= main__x) && main__x <= 93) && 93 <= main__y)) || (((main__x <= 69 && 69 <= main__y) && 69 <= main__x) && main__y <= 69)) || (((main__y <= 68 && 68 <= main__y) && main__x <= 68) && 68 <= main__x)) || (((72 <= main__y && 72 <= main__x) && main__y <= 72) && main__x <= 72)) || (((56 <= main__x && main__x <= 56) && 56 <= main__y) && main__y <= 56)) || (((main__x <= 73 && 73 <= main__y) && main__y <= 73) && 73 <= main__x)) || (((main__x <= 52 && 52 <= main__y) && main__y <= 52) && 52 <= main__x)) || (((88 <= main__x && main__x <= 88) && 88 <= main__y) && main__y <= 88)) || (((65 <= main__y && 65 <= main__x) && main__y <= 65) && main__x <= 65)) || (((main__y <= 53 && 53 <= main__x) && main__x <= 53) && 53 <= main__y)) || (((main__x <= 59 && 59 <= main__y) && main__y <= 59) && 59 <= main__x)) || (((84 <= main__y && 84 <= main__x) && main__x <= 84) && main__y <= 84)) || (((67 <= main__y && 67 <= main__x) && main__x <= 67) && main__y <= 67)) || (((51 <= main__y && main__y <= 51) && 51 <= main__x) && main__x <= 51)) || (((83 <= main__y && main__y <= 83) && main__x <= 83) && 83 <= main__x)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__x < 99 && 98 <= main__x) && 98 <= main__y) && main__y <= 98)) || (((main__y <= 97 && main__x < 98) && 97 <= main__y) && 97 <= main__x)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((63 <= main__y && 63 <= main__x) && main__x <= 63) && main__y <= 63)) || (((main__x <= 60 && 60 <= main__y) && main__y <= 60) && 60 <= main__x)) || (((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x)) || (((61 <= main__y && main__x <= 61) && 61 <= main__x) && main__y <= 61)) || (((main__x <= 78 && 78 <= main__x) && main__y <= 78) && 78 <= main__y)) || (((main__x <= 87 && 87 <= main__y) && main__y <= 87) && 87 <= main__x)) || (((91 <= main__x && 91 <= main__y) && main__x <= 91) && main__y <= 91)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__y <= 54 && main__x <= 54) && 54 <= main__y) && 54 <= main__x)) || (((main__y <= 76 && 76 <= main__x) && main__x <= 76) && 76 <= main__y)) || (((main__x <= 95 && 95 <= main__x) && 95 <= main__y) && main__y <= 95) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 7 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (main__x <= 2 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (main__x <= 8 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (main__x <= 5 && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (main__y <= 50 && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (main__y <= 50 && main__x <= 4) && 50 <= main__y RESULT: Ultimate proved your program to be correct! [2022-01-09 22:24:13,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...