/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_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:01:17,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:01:17,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:01:17,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:01:17,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:01:17,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:01:17,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:01:17,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:01:17,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:01:17,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:01:17,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:01:17,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:01:17,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:01:17,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:01:17,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:01:17,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:01:17,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:01:17,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:01:17,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:01:17,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:01:17,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:01:17,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:01:17,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:01:17,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:01:17,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:01:17,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:01:17,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:01:17,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:01:17,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:01:17,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:01:17,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:01:17,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:01:17,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:01:17,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:01:17,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:01:17,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:01:17,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:01:17,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:01:17,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:01:17,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:01:17,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:01:18,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:01:18,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:01:18,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:01:18,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:01:18,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:01:18,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:01:18,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:01:18,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:01:18,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:01:18,023 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:01:18,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:01:18,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:01:18,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:01:18,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:01:18,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:01:18,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:01:18,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:01:18,026 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:01:18,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:01:18,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:01:18,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:01:18,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:01:18,207 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:01:18,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c [2022-01-10 03:01:18,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e45e702/b0264f5a01034b2da73af7f7f0474d11/FLAGa556e4e83 [2022-01-10 03:01:18,552 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:01:18,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c [2022-01-10 03:01:18,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e45e702/b0264f5a01034b2da73af7f7f0474d11/FLAGa556e4e83 [2022-01-10 03:01:18,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e45e702/b0264f5a01034b2da73af7f7f0474d11 [2022-01-10 03:01:18,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:01:18,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:01:18,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:01:18,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:01:19,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:01:19,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:01:18" (1/1) ... [2022-01-10 03:01:19,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4c4e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19, skipping insertion in model container [2022-01-10 03:01:19,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:01:18" (1/1) ... [2022-01-10 03:01:19,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:01:19,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:01:19,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c[588,601] [2022-01-10 03:01:19,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:01:19,168 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:01:19,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound1.c[588,601] [2022-01-10 03:01:19,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:01:19,207 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:01:19,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19 WrapperNode [2022-01-10 03:01:19,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:01:19,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:01:19,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:01:19,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:01:19,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,241 INFO L137 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-01-10 03:01:19,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:01:19,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:01:19,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:01:19,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:01:19,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:01:19,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:01:19,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:01:19,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:01:19,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (1/1) ... [2022-01-10 03:01:19,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:01:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:01:19,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:01:19,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:01:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:01:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:01:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:01:19,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:01:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:01:19,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:01:19,353 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:01:19,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:01:19,484 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:01:19,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:01:19,488 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:01:19,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:01:19 BoogieIcfgContainer [2022-01-10 03:01:19,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:01:19,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:01:19,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:01:19,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:01:19,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:01:18" (1/3) ... [2022-01-10 03:01:19,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebd8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:01:19, skipping insertion in model container [2022-01-10 03:01:19,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:01:19" (2/3) ... [2022-01-10 03:01:19,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebd8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:01:19, skipping insertion in model container [2022-01-10 03:01:19,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:01:19" (3/3) ... [2022-01-10 03:01:19,502 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound1.c [2022-01-10 03:01:19,506 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:01:19,506 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:01:19,568 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:01:19,573 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:01:19,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:01:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:01:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 03:01:19,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:19,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:19,589 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2022-01-10 03:01:19,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978797847] [2022-01-10 03:01:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:19,602 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:19,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:19,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:01:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:19,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:01:19,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:01:19,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:19,707 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:19,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978797847] [2022-01-10 03:01:19,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978797847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:19,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:19,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:01:19,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597092392] [2022-01-10 03:01:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:19,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:01:19,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:01:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:01:19,744 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:01:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:19,766 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2022-01-10 03:01:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:01:19,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 03:01:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:19,784 INFO L225 Difference]: With dead ends: 51 [2022-01-10 03:01:19,784 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 03:01:19,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:01:19,792 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:19,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:01:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 03:01:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 03:01:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:01:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-01-10 03:01:19,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2022-01-10 03:01:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:19,840 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-01-10 03:01:19,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:01:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-01-10 03:01:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 03:01:19,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:19,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:19,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:20,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:20,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2022-01-10 03:01:20,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:20,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131705203] [2022-01-10 03:01:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:20,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:20,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:20,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:01:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:20,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:01:20,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:01:20,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:20,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131705203] [2022-01-10 03:01:20,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131705203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:20,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:20,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:20,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301347150] [2022-01-10 03:01:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:20,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:20,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:20,161 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:01:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:20,786 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2022-01-10 03:01:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:20,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 03:01:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:20,787 INFO L225 Difference]: With dead ends: 42 [2022-01-10 03:01:20,787 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 03:01:20,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:20,789 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:20,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 127 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 03:01:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 03:01:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-01-10 03:01:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:01:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2022-01-10 03:01:20,798 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 9 [2022-01-10 03:01:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:20,798 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2022-01-10 03:01:20,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:01:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2022-01-10 03:01:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 03:01:20,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:20,799 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:20,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:21,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:21,013 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2022-01-10 03:01:21,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:21,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076028305] [2022-01-10 03:01:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:21,014 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:21,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:21,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:01:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:21,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:01:21,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:01:21,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:21,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:21,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076028305] [2022-01-10 03:01:21,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076028305] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:21,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:21,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:21,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028912991] [2022-01-10 03:01:21,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:21,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:21,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:21,166 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:01:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:21,928 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-01-10 03:01:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-10 03:01:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:21,942 INFO L225 Difference]: With dead ends: 46 [2022-01-10 03:01:21,942 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 03:01:21,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:21,943 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:21,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 03:01:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 03:01:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-01-10 03:01:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:01:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-01-10 03:01:21,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 14 [2022-01-10 03:01:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:21,951 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-01-10 03:01:21,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:01:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-01-10 03:01:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 03:01:21,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:21,951 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:21,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:22,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:22,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2022-01-10 03:01:22,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:22,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844163637] [2022-01-10 03:01:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:22,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:22,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:22,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:01:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:22,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:01:22,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:01:22,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:22,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:22,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844163637] [2022-01-10 03:01:22,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844163637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:22,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:22,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:22,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660278200] [2022-01-10 03:01:22,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:22,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:22,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:22,373 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:01:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:23,321 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-01-10 03:01:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-01-10 03:01:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:23,338 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:01:23,338 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 03:01:23,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:23,339 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:23,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 03:01:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 03:01:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-01-10 03:01:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-10 03:01:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-01-10 03:01:23,346 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 19 [2022-01-10 03:01:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:23,346 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-01-10 03:01:23,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:01:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-01-10 03:01:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 03:01:23,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:23,347 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:23,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:23,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:23,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2022-01-10 03:01:23,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:23,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098005192] [2022-01-10 03:01:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:23,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:23,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:23,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:23,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:01:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:23,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:01:23,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:01:23,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:01:23,790 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:23,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098005192] [2022-01-10 03:01:23,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098005192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:01:23,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:01:23,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:01:23,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022245646] [2022-01-10 03:01:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:23,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:23,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:23,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:23,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:01:23,792 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:01:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:25,641 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-01-10 03:01:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:01:25,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-01-10 03:01:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:25,651 INFO L225 Difference]: With dead ends: 58 [2022-01-10 03:01:25,651 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 03:01:25,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:01:25,652 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:25,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 03:01:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 03:01:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 03:01:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:01:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-01-10 03:01:25,658 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 24 [2022-01-10 03:01:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:25,659 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-01-10 03:01:25,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:01:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-01-10 03:01:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 03:01:25,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:25,659 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:25,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:25,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:25,866 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1030293625, now seen corresponding path program 1 times [2022-01-10 03:01:25,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:25,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506663329] [2022-01-10 03:01:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:25,867 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:25,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:25,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:25,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:01:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:26,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:01:26,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:01:26,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-10 03:01:26,483 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:26,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506663329] [2022-01-10 03:01:26,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506663329] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:01:26,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:01:26,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-01-10 03:01:26,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422543870] [2022-01-10 03:01:26,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:26,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:26,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:26,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:26,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:01:26,485 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:01:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:27,326 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-01-10 03:01:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:01:27,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-01-10 03:01:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:27,337 INFO L225 Difference]: With dead ends: 52 [2022-01-10 03:01:27,337 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 03:01:27,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:27,338 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:27,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 85 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 03:01:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 03:01:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-01-10 03:01:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:01:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-01-10 03:01:27,345 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 36 [2022-01-10 03:01:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:27,345 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-01-10 03:01:27,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:01:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-01-10 03:01:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:01:27,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:27,346 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:27,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:27,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:27,547 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -492592860, now seen corresponding path program 2 times [2022-01-10 03:01:27,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:27,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612790122] [2022-01-10 03:01:27,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:01:27,548 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:27,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:27,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:01:27,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:01:27,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:27,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:01:27,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 03:01:27,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 03:01:31,839 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:31,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612790122] [2022-01-10 03:01:31,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612790122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:31,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:31,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:01:31,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547712751] [2022-01-10 03:01:31,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:31,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:01:31,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:01:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:31,841 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 03:01:36,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:39,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:41,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:43,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:48,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:51,053 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-01-10 03:01:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:01:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-01-10 03:01:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:51,064 INFO L225 Difference]: With dead ends: 103 [2022-01-10 03:01:51,065 INFO L226 Difference]: Without dead ends: 101 [2022-01-10 03:01:51,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:01:51,065 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 15 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 60 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:51,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 319 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 157 Invalid, 5 Unknown, 0 Unchecked, 17.8s Time] [2022-01-10 03:01:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-10 03:01:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2022-01-10 03:01:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 33 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-10 03:01:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2022-01-10 03:01:51,080 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 41 [2022-01-10 03:01:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:51,080 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2022-01-10 03:01:51,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 03:01:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2022-01-10 03:01:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:01:51,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:51,081 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:51,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:51,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:01:51,292 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 3 times [2022-01-10 03:01:51,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:51,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99328409] [2022-01-10 03:01:51,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:01:51,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:51,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:51,294 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:01:51,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:01:51,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 03:01:51,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:51,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:01:51,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:01:51,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:02:00,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:00,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99328409] [2022-01-10 03:02:00,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99328409] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:02:00,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:02:00,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:02:00,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73176995] [2022-01-10 03:02:00,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:02:00,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:02:00,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:02:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:02:00,072 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-01-10 03:02:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:03,770 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2022-01-10 03:02:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:02:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-01-10 03:02:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:03,783 INFO L225 Difference]: With dead ends: 91 [2022-01-10 03:02:03,783 INFO L226 Difference]: Without dead ends: 89 [2022-01-10 03:02:03,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:02:03,784 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:03,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 279 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-10 03:02:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-10 03:02:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-01-10 03:02:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 47 states have internal predecessors, (48), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-01-10 03:02:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2022-01-10 03:02:03,795 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 46 [2022-01-10 03:02:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:03,796 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2022-01-10 03:02:03,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-01-10 03:02:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2022-01-10 03:02:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:02:03,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:03,797 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:03,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:04,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:04,004 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 900098756, now seen corresponding path program 4 times [2022-01-10 03:02:04,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:04,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518667012] [2022-01-10 03:02:04,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:02:04,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:04,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:04,005 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:02:04,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:02:04,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:02:04,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:02:04,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:02:04,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:02:12,456 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:12,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518667012] [2022-01-10 03:02:12,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518667012] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:02:12,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:02:12,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:02:12,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886744635] [2022-01-10 03:02:12,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:02:12,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:02:12,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:02:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:02:12,459 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-01-10 03:02:22,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:25,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:27,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:29,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:34,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:36,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:40,224 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2022-01-10 03:02:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:02:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 51 [2022-01-10 03:02:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:40,239 INFO L225 Difference]: With dead ends: 115 [2022-01-10 03:02:40,239 INFO L226 Difference]: Without dead ends: 108 [2022-01-10 03:02:40,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:02:40,241 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:40,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 320 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 5 Unknown, 0 Unchecked, 23.3s Time] [2022-01-10 03:02:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-10 03:02:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-01-10 03:02:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 54 states have internal predecessors, (56), 39 states have call successors, (39), 12 states have call predecessors, (39), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-01-10 03:02:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2022-01-10 03:02:40,265 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 51 [2022-01-10 03:02:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:40,265 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2022-01-10 03:02:40,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-01-10 03:02:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2022-01-10 03:02:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 03:02:40,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:40,267 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:40,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:02:40,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:02:40,467 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2022-01-10 03:02:40,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:40,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662395521] [2022-01-10 03:02:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:40,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:40,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:02:40,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:02:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:40,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 03:02:40,875 INFO L286 TraceCheckSpWp]: Computing forward predicates...