/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/bitvector/soft_float_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:40:16,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:40:16,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:40:16,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:40:16,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:40:16,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:40:16,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:40:16,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:40:16,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:40:16,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:40:16,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:40:16,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:40:16,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:40:16,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:40:16,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:40:16,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:40:16,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:40:16,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:40:16,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:40:16,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:40:16,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:40:16,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:40:16,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:40:16,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:40:16,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:40:16,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:40:16,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:40:16,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:40:16,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:40:16,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:40:16,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:40:16,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:40:16,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:40:16,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:40:16,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:40:16,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:40:16,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:40:16,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:40:16,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:40:16,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:40:16,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:40:16,640 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 02:40:16,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:40:16,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:40:16,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:40:16,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:40:16,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:40:16,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:40:16,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:40:16,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:40:16,663 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:40:16,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:40:16,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:40:16,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:40:16,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:40:16,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:40:16,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:40:16,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:16,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:16,665 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:40:16,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:40:16,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:40:16,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:40:16,666 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 02:40:16,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:40:16,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:40:16,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:40:16,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:40:16,890 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:40:16,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2022-01-10 02:40:16,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb42e54ed/e8c42e862b9e41fe8eb3fe7a4caf41d6/FLAG77212442d [2022-01-10 02:40:17,287 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:40:17,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2022-01-10 02:40:17,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb42e54ed/e8c42e862b9e41fe8eb3fe7a4caf41d6/FLAG77212442d [2022-01-10 02:40:17,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb42e54ed/e8c42e862b9e41fe8eb3fe7a4caf41d6 [2022-01-10 02:40:17,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:40:17,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:40:17,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:17,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:40:17,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:40:17,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:17" (1/1) ... [2022-01-10 02:40:17,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ac4844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:17, skipping insertion in model container [2022-01-10 02:40:17,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:17" (1/1) ... [2022-01-10 02:40:17,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:40:17,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:40:17,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c[728,741] [2022-01-10 02:40:17,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:17,956 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:40:17,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c[728,741] [2022-01-10 02:40:17,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:18,006 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:40:18,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18 WrapperNode [2022-01-10 02:40:18,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:18,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:18,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:40:18,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:40:18,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,039 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2022-01-10 02:40:18,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:18,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:40:18,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:40:18,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:40:18,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:40:18,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:40:18,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:40:18,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:40:18,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (1/1) ... [2022-01-10 02:40:18,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:18,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:40:18,124 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 02:40:18,151 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 02:40:18,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:40:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:40:18,167 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-01-10 02:40:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-01-10 02:40:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:40:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:40:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 02:40:18,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 02:40:18,256 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:40:18,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:40:18,541 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:40:18,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:40:18,547 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 02:40:18,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:18 BoogieIcfgContainer [2022-01-10 02:40:18,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:40:18,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:40:18,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:40:18,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:40:18,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:17" (1/3) ... [2022-01-10 02:40:18,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b88d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:18, skipping insertion in model container [2022-01-10 02:40:18,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:18" (2/3) ... [2022-01-10 02:40:18,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b88d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:18, skipping insertion in model container [2022-01-10 02:40:18,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:18" (3/3) ... [2022-01-10 02:40:18,556 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2022-01-10 02:40:18,560 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:40:18,560 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:40:18,604 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:40:18,610 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 02:40:18,610 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:40:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 02:40:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 02:40:18,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:18,633 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:18,635 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1428146956, now seen corresponding path program 1 times [2022-01-10 02:40:18,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:18,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424440203] [2022-01-10 02:40:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:18,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:18,660 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 02:40:18,661 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 02:40:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:18,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:18,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:18,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:18,948 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:18,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424440203] [2022-01-10 02:40:18,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424440203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:18,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:18,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:18,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940371993] [2022-01-10 02:40:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:18,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:18,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:18,989 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.558139534883721) internal successors, (67), 45 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:19,095 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2022-01-10 02:40:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:19,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-10 02:40:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:19,113 INFO L225 Difference]: With dead ends: 115 [2022-01-10 02:40:19,113 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 02:40:19,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:19,122 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:19,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 02:40:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-01-10 02:40:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 02:40:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-01-10 02:40:19,154 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 42 [2022-01-10 02:40:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:19,155 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-01-10 02:40:19,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-01-10 02:40:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 02:40:19,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:19,157 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:19,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 02:40:19,363 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 02:40:19,363 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -649725496, now seen corresponding path program 1 times [2022-01-10 02:40:19,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:19,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477404199] [2022-01-10 02:40:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:19,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:19,366 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 02:40:19,368 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 02:40:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:19,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:19,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:19,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:19,515 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:19,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477404199] [2022-01-10 02:40:19,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477404199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:19,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:19,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:19,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698196409] [2022-01-10 02:40:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:19,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:19,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:19,519 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:19,583 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2022-01-10 02:40:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:40:19,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-01-10 02:40:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:19,585 INFO L225 Difference]: With dead ends: 107 [2022-01-10 02:40:19,585 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 02:40:19,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:19,587 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:19,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 157 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 02:40:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-01-10 02:40:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-01-10 02:40:19,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2022-01-10 02:40:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:19,597 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-01-10 02:40:19,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-01-10 02:40:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 02:40:19,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:19,599 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:19,614 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 02:40:19,808 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 02:40:19,808 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 996548609, now seen corresponding path program 1 times [2022-01-10 02:40:19,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:19,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344268484] [2022-01-10 02:40:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:19,810 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:19,812 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 02:40:19,814 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 02:40:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:19,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:19,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:19,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:19,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:19,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344268484] [2022-01-10 02:40:19,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344268484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:19,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:19,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:19,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435260014] [2022-01-10 02:40:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:19,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:19,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:19,963 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:20,044 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2022-01-10 02:40:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-10 02:40:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:20,046 INFO L225 Difference]: With dead ends: 116 [2022-01-10 02:40:20,046 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 02:40:20,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:20,048 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:20,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 150 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 02:40:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2022-01-10 02:40:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-01-10 02:40:20,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 46 [2022-01-10 02:40:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:20,060 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-01-10 02:40:20,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-01-10 02:40:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 02:40:20,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:20,062 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:20,075 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 02:40:20,271 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 02:40:20,271 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1306691689, now seen corresponding path program 1 times [2022-01-10 02:40:20,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:20,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678015513] [2022-01-10 02:40:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:20,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:20,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:20,274 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 02:40:20,276 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 02:40:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:20,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:20,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:20,430 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:20,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678015513] [2022-01-10 02:40:20,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678015513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:20,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:20,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:40:20,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367210974] [2022-01-10 02:40:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:20,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:40:20,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:40:20,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:20,436 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:20,552 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2022-01-10 02:40:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:40:20,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-01-10 02:40:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:20,554 INFO L225 Difference]: With dead ends: 124 [2022-01-10 02:40:20,554 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 02:40:20,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:20,556 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:20,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 198 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 02:40:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2022-01-10 02:40:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2022-01-10 02:40:20,570 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 47 [2022-01-10 02:40:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:20,571 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-01-10 02:40:20,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2022-01-10 02:40:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 02:40:20,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:20,572 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:20,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 02:40:20,779 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 02:40:20,779 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash 164215198, now seen corresponding path program 1 times [2022-01-10 02:40:20,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:20,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306649086] [2022-01-10 02:40:20,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:20,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:20,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:20,782 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 02:40:20,783 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 02:40:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:20,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:20,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:20,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:21,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306649086] [2022-01-10 02:40:21,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306649086] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:21,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:21,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 02:40:21,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531741130] [2022-01-10 02:40:21,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:21,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:40:21,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:40:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:21,160 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:21,371 INFO L93 Difference]: Finished difference Result 145 states and 207 transitions. [2022-01-10 02:40:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:40:21,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2022-01-10 02:40:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:21,374 INFO L225 Difference]: With dead ends: 145 [2022-01-10 02:40:21,374 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 02:40:21,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:40:21,375 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 60 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:21,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 271 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 02:40:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-01-10 02:40:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2022-01-10 02:40:21,387 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 48 [2022-01-10 02:40:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:21,387 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2022-01-10 02:40:21,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2022-01-10 02:40:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 02:40:21,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:21,389 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:21,403 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 02:40:21,589 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 02:40:21,590 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1819650751, now seen corresponding path program 1 times [2022-01-10 02:40:21,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:21,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403433775] [2022-01-10 02:40:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:21,591 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:21,592 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 02:40:21,593 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 02:40:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:21,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:21,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:21,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:22,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:22,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403433775] [2022-01-10 02:40:22,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403433775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:22,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:22,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 02:40:22,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584032895] [2022-01-10 02:40:22,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:22,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:40:22,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:40:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:40:22,045 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:22,333 INFO L93 Difference]: Finished difference Result 163 states and 235 transitions. [2022-01-10 02:40:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:40:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-01-10 02:40:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:22,335 INFO L225 Difference]: With dead ends: 163 [2022-01-10 02:40:22,335 INFO L226 Difference]: Without dead ends: 104 [2022-01-10 02:40:22,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:40:22,337 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 102 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:22,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 324 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:40:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-10 02:40:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2022-01-10 02:40:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:40:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2022-01-10 02:40:22,355 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 50 [2022-01-10 02:40:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:22,355 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2022-01-10 02:40:22,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2022-01-10 02:40:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:40:22,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:22,357 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:22,368 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 02:40:22,557 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 02:40:22,558 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -231695800, now seen corresponding path program 2 times [2022-01-10 02:40:22,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:22,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233048774] [2022-01-10 02:40:22,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:22,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:22,560 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 02:40:22,570 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 02:40:22,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:40:22,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:22,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:40:22,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 02:40:22,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:22,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:22,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233048774] [2022-01-10 02:40:22,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233048774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:22,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:22,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:40:22,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973777910] [2022-01-10 02:40:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:40:22,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:40:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:22,747 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:22,806 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2022-01-10 02:40:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:40:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-01-10 02:40:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:22,808 INFO L225 Difference]: With dead ends: 115 [2022-01-10 02:40:22,808 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 02:40:22,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:40:22,809 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:22,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 353 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 02:40:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2022-01-10 02:40:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 74 states have internal predecessors, (101), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2022-01-10 02:40:22,822 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 57 [2022-01-10 02:40:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:22,822 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2022-01-10 02:40:22,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2022-01-10 02:40:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 02:40:22,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:22,823 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:22,837 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 02:40:23,037 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 02:40:23,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash -624722810, now seen corresponding path program 1 times [2022-01-10 02:40:23,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:23,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78998109] [2022-01-10 02:40:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:23,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:23,043 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 02:40:23,047 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 02:40:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:23,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:40:23,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:23,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:23,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:23,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78998109] [2022-01-10 02:40:23,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78998109] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:23,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:23,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-01-10 02:40:23,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700816715] [2022-01-10 02:40:23,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:23,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:40:23,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:23,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:40:23,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:40:23,635 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:24,414 INFO L93 Difference]: Finished difference Result 230 states and 331 transitions. [2022-01-10 02:40:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 02:40:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2022-01-10 02:40:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:24,416 INFO L225 Difference]: With dead ends: 230 [2022-01-10 02:40:24,416 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 02:40:24,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-01-10 02:40:24,417 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 179 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:24,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 574 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:40:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 02:40:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2022-01-10 02:40:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.441860465116279) internal successors, (124), 88 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2022-01-10 02:40:24,440 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 57 [2022-01-10 02:40:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:24,440 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2022-01-10 02:40:24,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2022-01-10 02:40:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 02:40:24,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:24,442 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:24,455 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 02:40:24,658 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 02:40:24,658 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash 539901053, now seen corresponding path program 1 times [2022-01-10 02:40:24,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:24,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124762693] [2022-01-10 02:40:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:24,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:24,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:24,661 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 02:40:24,662 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 02:40:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:24,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:40:24,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:24,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:25,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124762693] [2022-01-10 02:40:25,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124762693] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:25,226 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:25,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-01-10 02:40:25,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813075522] [2022-01-10 02:40:25,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:25,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 02:40:25,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 02:40:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:40:25,227 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:25,981 INFO L93 Difference]: Finished difference Result 253 states and 369 transitions. [2022-01-10 02:40:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 02:40:25,981 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2022-01-10 02:40:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:25,983 INFO L225 Difference]: With dead ends: 253 [2022-01-10 02:40:25,983 INFO L226 Difference]: Without dead ends: 163 [2022-01-10 02:40:25,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2022-01-10 02:40:25,984 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 346 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:25,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 825 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:40:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-10 02:40:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2022-01-10 02:40:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.46875) internal successors, (141), 98 states have internal predecessors, (141), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2022-01-10 02:40:25,997 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 62 [2022-01-10 02:40:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:25,997 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2022-01-10 02:40:25,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 states have internal predecessors, (73), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2022-01-10 02:40:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 02:40:25,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:25,999 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:26,014 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 02:40:26,207 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 02:40:26,208 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash 74548550, now seen corresponding path program 2 times [2022-01-10 02:40:26,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:26,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912912168] [2022-01-10 02:40:26,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:26,209 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:26,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:26,210 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 02:40:26,211 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 02:40:26,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:40:26,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:26,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:26,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-01-10 02:40:26,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:26,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912912168] [2022-01-10 02:40:26,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912912168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:26,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:26,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:26,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612693563] [2022-01-10 02:40:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:26,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:26,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:26,373 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:26,386 INFO L93 Difference]: Finished difference Result 130 states and 190 transitions. [2022-01-10 02:40:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2022-01-10 02:40:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:26,389 INFO L225 Difference]: With dead ends: 130 [2022-01-10 02:40:26,389 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 02:40:26,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:26,390 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:26,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 02:40:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-10 02:40:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 98 states have internal predecessors, (139), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2022-01-10 02:40:26,402 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 75 [2022-01-10 02:40:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:26,402 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2022-01-10 02:40:26,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2022-01-10 02:40:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:40:26,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:26,404 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:26,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:26,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:26,613 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1514518048, now seen corresponding path program 1 times [2022-01-10 02:40:26,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777324098] [2022-01-10 02:40:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:26,614 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:26,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:26,615 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:26,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 02:40:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:26,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 02:40:26,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:27,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:27,889 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:27,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777324098] [2022-01-10 02:40:27,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777324098] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:27,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:27,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-01-10 02:40:27,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344038050] [2022-01-10 02:40:27,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:27,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 02:40:27,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 02:40:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-01-10 02:40:27,891 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:31,045 INFO L93 Difference]: Finished difference Result 356 states and 515 transitions. [2022-01-10 02:40:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-10 02:40:31,046 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2022-01-10 02:40:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:31,047 INFO L225 Difference]: With dead ends: 356 [2022-01-10 02:40:31,048 INFO L226 Difference]: Without dead ends: 256 [2022-01-10 02:40:31,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=729, Invalid=1433, Unknown=0, NotChecked=0, Total=2162 [2022-01-10 02:40:31,049 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 683 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:31,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [683 Valid, 1599 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:40:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-01-10 02:40:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 133. [2022-01-10 02:40:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 122 states have (on average 1.4918032786885247) internal successors, (182), 124 states have internal predecessors, (182), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2022-01-10 02:40:31,066 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 77 [2022-01-10 02:40:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:31,067 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2022-01-10 02:40:31,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2022-01-10 02:40:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 02:40:31,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:31,068 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:31,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:31,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,277 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash -716219753, now seen corresponding path program 1 times [2022-01-10 02:40:31,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:31,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253033832] [2022-01-10 02:40:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:31,278 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:31,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:31,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 02:40:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:31,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 02:40:31,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:31,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:32,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:32,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253033832] [2022-01-10 02:40:32,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253033832] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:32,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:32,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-01-10 02:40:32,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998597067] [2022-01-10 02:40:32,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:32,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 02:40:32,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 02:40:32,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 02:40:32,421 INFO L87 Difference]: Start difference. First operand 133 states and 200 transitions. Second operand has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:33,965 INFO L93 Difference]: Finished difference Result 357 states and 521 transitions. [2022-01-10 02:40:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-10 02:40:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2022-01-10 02:40:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:33,968 INFO L225 Difference]: With dead ends: 357 [2022-01-10 02:40:33,968 INFO L226 Difference]: Without dead ends: 231 [2022-01-10 02:40:33,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2022-01-10 02:40:33,969 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 919 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:33,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [919 Valid, 1560 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:40:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-10 02:40:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 137. [2022-01-10 02:40:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.5) internal successors, (189), 128 states have internal predecessors, (189), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2022-01-10 02:40:33,982 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 88 [2022-01-10 02:40:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:33,983 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2022-01-10 02:40:33,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.6176470588235294) internal successors, (123), 34 states have internal predecessors, (123), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2022-01-10 02:40:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 02:40:33,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:33,984 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:33,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:34,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:34,194 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1526290336, now seen corresponding path program 2 times [2022-01-10 02:40:34,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:34,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132948136] [2022-01-10 02:40:34,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:34,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:34,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:34,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:34,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 02:40:34,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:40:34,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:34,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:34,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2022-01-10 02:40:34,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:34,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:34,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132948136] [2022-01-10 02:40:34,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132948136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:34,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:34,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:40:34,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090193324] [2022-01-10 02:40:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:34,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:34,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:34,407 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:34,425 INFO L93 Difference]: Finished difference Result 162 states and 240 transitions. [2022-01-10 02:40:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:40:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 113 [2022-01-10 02:40:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:34,427 INFO L225 Difference]: With dead ends: 162 [2022-01-10 02:40:34,427 INFO L226 Difference]: Without dead ends: 137 [2022-01-10 02:40:34,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:34,428 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:34,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-10 02:40:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-01-10 02:40:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 128 states have internal predecessors, (187), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2022-01-10 02:40:34,437 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 113 [2022-01-10 02:40:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:34,438 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2022-01-10 02:40:34,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2022-01-10 02:40:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 02:40:34,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:34,439 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:34,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:34,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:34,647 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash 939484322, now seen corresponding path program 1 times [2022-01-10 02:40:34,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:34,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901057192] [2022-01-10 02:40:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:34,649 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:34,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:34,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 02:40:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:34,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 02:40:34,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 24 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 02:40:35,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 02:40:37,905 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:37,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901057192] [2022-01-10 02:40:37,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901057192] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:37,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:37,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-01-10 02:40:37,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039413506] [2022-01-10 02:40:37,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:37,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-10 02:40:37,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-10 02:40:37,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2022-01-10 02:40:37,908 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 50 states, 50 states have (on average 3.46) internal successors, (173), 50 states have internal predecessors, (173), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:53,264 INFO L93 Difference]: Finished difference Result 590 states and 863 transitions. [2022-01-10 02:40:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-01-10 02:40:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.46) internal successors, (173), 50 states have internal predecessors, (173), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 113 [2022-01-10 02:40:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:53,270 INFO L225 Difference]: With dead ends: 590 [2022-01-10 02:40:53,270 INFO L226 Difference]: Without dead ends: 460 [2022-01-10 02:40:53,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2901, Invalid=6029, Unknown=0, NotChecked=0, Total=8930 [2022-01-10 02:40:53,274 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 2087 mSDsluCounter, 4822 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2087 SdHoareTripleChecker+Valid, 5030 SdHoareTripleChecker+Invalid, 4590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:53,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2087 Valid, 5030 Invalid, 4590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-01-10 02:40:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-01-10 02:40:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 205. [2022-01-10 02:40:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.5463917525773196) internal successors, (300), 196 states have internal predecessors, (300), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 318 transitions. [2022-01-10 02:40:53,303 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 318 transitions. Word has length 113 [2022-01-10 02:40:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:53,303 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 318 transitions. [2022-01-10 02:40:53,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.46) internal successors, (173), 50 states have internal predecessors, (173), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:40:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 318 transitions. [2022-01-10 02:40:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 02:40:53,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:53,305 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:53,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:53,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:53,514 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1922599335, now seen corresponding path program 1 times [2022-01-10 02:40:53,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:53,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962072597] [2022-01-10 02:40:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:53,515 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:53,516 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:53,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 02:40:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:53,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:53,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2022-01-10 02:40:53,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2022-01-10 02:40:53,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962072597] [2022-01-10 02:40:53,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962072597] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:53,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:53,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-01-10 02:40:53,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800686638] [2022-01-10 02:40:53,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:53,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:53,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:53,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:53,898 INFO L87 Difference]: Start difference. First operand 205 states and 318 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:53,934 INFO L93 Difference]: Finished difference Result 210 states and 322 transitions. [2022-01-10 02:40:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:40:53,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2022-01-10 02:40:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:53,936 INFO L225 Difference]: With dead ends: 210 [2022-01-10 02:40:53,936 INFO L226 Difference]: Without dead ends: 205 [2022-01-10 02:40:53,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:53,937 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 244 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:53,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 244 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-10 02:40:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-01-10 02:40:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.541237113402062) internal successors, (299), 196 states have internal predecessors, (299), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2022-01-10 02:40:53,952 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 118 [2022-01-10 02:40:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:53,952 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions. [2022-01-10 02:40:53,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2022-01-10 02:40:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 02:40:53,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:53,954 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:53,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:54,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:54,164 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 39463391, now seen corresponding path program 1 times [2022-01-10 02:40:54,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571371062] [2022-01-10 02:40:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:54,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:54,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:54,166 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:54,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 02:40:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:54,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:54,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2022-01-10 02:40:54,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:54,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:54,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571371062] [2022-01-10 02:40:54,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571371062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:54,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:54,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:40:54,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752408906] [2022-01-10 02:40:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:54,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:40:54,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:40:54,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:54,374 INFO L87 Difference]: Start difference. First operand 205 states and 317 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:54,415 INFO L93 Difference]: Finished difference Result 218 states and 330 transitions. [2022-01-10 02:40:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:54,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2022-01-10 02:40:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:54,417 INFO L225 Difference]: With dead ends: 218 [2022-01-10 02:40:54,417 INFO L226 Difference]: Without dead ends: 212 [2022-01-10 02:40:54,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:54,419 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:54,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 227 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-10 02:40:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-01-10 02:40:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 199 states have (on average 1.5276381909547738) internal successors, (304), 201 states have internal predecessors, (304), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-10 02:40:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 322 transitions. [2022-01-10 02:40:54,440 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 322 transitions. Word has length 120 [2022-01-10 02:40:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:54,440 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 322 transitions. [2022-01-10 02:40:54,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 322 transitions. [2022-01-10 02:40:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 02:40:54,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:54,443 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:54,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:54,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:54,652 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:54,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash 96721693, now seen corresponding path program 1 times [2022-01-10 02:40:54,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:54,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063554941] [2022-01-10 02:40:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:54,653 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:54,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:54,654 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 02:40:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:54,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:54,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2022-01-10 02:40:54,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:54,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:54,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063554941] [2022-01-10 02:40:54,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063554941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:54,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:54,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:40:54,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83946158] [2022-01-10 02:40:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:54,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:54,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:54,875 INFO L87 Difference]: Start difference. First operand 210 states and 322 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:54,914 INFO L93 Difference]: Finished difference Result 216 states and 327 transitions. [2022-01-10 02:40:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:40:54,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2022-01-10 02:40:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:54,916 INFO L225 Difference]: With dead ends: 216 [2022-01-10 02:40:54,916 INFO L226 Difference]: Without dead ends: 198 [2022-01-10 02:40:54,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:54,917 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:54,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 294 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-10 02:40:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-01-10 02:40:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 187 states have (on average 1.5454545454545454) internal successors, (289), 190 states have internal predecessors, (289), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 02:40:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2022-01-10 02:40:54,931 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 120 [2022-01-10 02:40:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:54,932 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2022-01-10 02:40:54,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 02:40:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2022-01-10 02:40:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-10 02:40:54,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:54,933 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:54,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-01-10 02:40:55,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:55,143 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash 38983873, now seen corresponding path program 1 times [2022-01-10 02:40:55,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:55,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917394204] [2022-01-10 02:40:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:55,144 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:55,145 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:55,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 02:40:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:55,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:40:55,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-01-10 02:40:55,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-01-10 02:40:55,578 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:55,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917394204] [2022-01-10 02:40:55,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917394204] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:55,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:55,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-01-10 02:40:55,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134922286] [2022-01-10 02:40:55,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:55,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:40:55,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:40:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:55,580 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:55,663 INFO L93 Difference]: Finished difference Result 225 states and 337 transitions. [2022-01-10 02:40:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:40:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2022-01-10 02:40:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:55,665 INFO L225 Difference]: With dead ends: 225 [2022-01-10 02:40:55,665 INFO L226 Difference]: Without dead ends: 195 [2022-01-10 02:40:55,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:40:55,666 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:55,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 370 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-01-10 02:40:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-01-10 02:40:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 187 states have internal predecessors, (241), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:40:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2022-01-10 02:40:55,678 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 125 [2022-01-10 02:40:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:55,679 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2022-01-10 02:40:55,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2022-01-10 02:40:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 02:40:55,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:55,680 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:55,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:55,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:55,890 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash 147310070, now seen corresponding path program 2 times [2022-01-10 02:40:55,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:55,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925883813] [2022-01-10 02:40:55,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:55,891 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:55,892 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:55,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 02:40:55,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:40:55,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:55,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 02:40:55,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2022-01-10 02:40:56,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:56,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925883813] [2022-01-10 02:40:56,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925883813] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:40:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [694417896] [2022-01-10 02:40:56,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:56,532 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 02:40:56,535 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 02:40:56,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-01-10 02:40:56,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:40:56,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:56,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 02:40:56,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2022-01-10 02:40:56,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2022-01-10 02:40:57,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [694417896] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:57,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:40:57,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-01-10 02:40:57,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838466118] [2022-01-10 02:40:57,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:57,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:40:57,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:40:57,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:40:57,010 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:57,145 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2022-01-10 02:40:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:40:57,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 129 [2022-01-10 02:40:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:57,146 INFO L225 Difference]: With dead ends: 196 [2022-01-10 02:40:57,146 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:40:57,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-01-10 02:40:57,147 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:57,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 269 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-01-10 02:40:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:40:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:40:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:40:57,148 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2022-01-10 02:40:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:57,148 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:40:57,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:40:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:40:57,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:40:57,151 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:40:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:57,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:57,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:57,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:40:59,785 INFO L854 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (not (= |base2flt_#in~m| (_ bv0 32))) [2022-01-10 02:40:59,785 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| (_ bv0 32))))) (and (or (not (bvsle base2flt_~e (_ bv4294967168 32))) .cse0) (not (bvult |base2flt_#in~m| (_ bv16777216 32))) (or (not (bvsle (bvadd (_ bv4294967274 32) base2flt_~e) (_ bv4294967168 32))) .cse0))) [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2022-01-10 02:40:59,785 INFO L861 garLoopResultBuilder]: At program point base2fltENTRY(lines 24 82) the Hoare annotation is: true [2022-01-10 02:40:59,785 INFO L854 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (or (and (= base2flt_~e |base2flt_#in~e|) (= base2flt_~__retres4~0 (_ bv0 32)) (= base2flt_~m (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (not (= |base2flt_#in~m| (_ bv0 32)))) [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2022-01-10 02:40:59,785 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (and (not (= |base2flt_#in~m| (_ bv0 32))) (or (bvult base2flt_~m (_ bv16777216 32)) (not (= |base2flt_#in~m| (_ bv1 32))))) [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L854 garLoopResultBuilder]: At program point L217(lines 147 219) the Hoare annotation is: (or (= (_ bv4294967295 32) |ULTIMATE.start_main_~sa~0#1|) (and (= (_ bv0 32) |ULTIMATE.start_mulflt_#res#1|) (= |ULTIMATE.start_mulflt_~__retres10~1#1| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|)) (and (= |ULTIMATE.start_main_~tmp~2#1| (_ bv1 32)) (= |ULTIMATE.start_main_~sa~0#1| (_ bv1 32)))) [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L861 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2022-01-10 02:40:59,786 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L256-1(lines 256 272) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L854 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L854 garLoopResultBuilder]: At program point L257-2(lines 257 266) the Hoare annotation is: (and (= |ULTIMATE.start_main_~tmp___0~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~tmp___1~0#1| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|)) [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2022-01-10 02:40:59,787 INFO L858 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L854 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: (or (= (_ bv4294967295 32) |ULTIMATE.start_main_~sa~0#1|) (and (= |ULTIMATE.start_main_~tmp~2#1| (_ bv1 32)) (= |ULTIMATE.start_main_~sa~0#1| (_ bv1 32))) (and (= |ULTIMATE.start_mulflt_~__retres10~1#1| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|))) [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L861 garLoopResultBuilder]: At program point L274(lines 220 276) the Hoare annotation is: true [2022-01-10 02:40:59,788 INFO L854 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 20) the Hoare annotation is: true [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2022-01-10 02:40:59,788 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 02:40:59,791 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:59,792 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:40:59,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:40:59 BoogieIcfgContainer [2022-01-10 02:40:59,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:40:59,814 INFO L158 Benchmark]: Toolchain (without parser) took 42097.44ms. Allocated memory was 192.9MB in the beginning and 307.2MB in the end (delta: 114.3MB). Free memory was 135.1MB in the beginning and 135.9MB in the end (delta: -820.9kB). Peak memory consumption was 155.9MB. Max. memory is 8.0GB. [2022-01-10 02:40:59,814 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:40:59,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.19ms. Allocated memory was 192.9MB in the beginning and 307.2MB in the end (delta: 114.3MB). Free memory was 134.9MB in the beginning and 275.6MB in the end (delta: -140.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-01-10 02:40:59,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.39ms. Allocated memory is still 307.2MB. Free memory was 275.6MB in the beginning and 274.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 02:40:59,816 INFO L158 Benchmark]: Boogie Preprocessor took 38.37ms. Allocated memory is still 307.2MB. Free memory was 274.1MB in the beginning and 272.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:59,816 INFO L158 Benchmark]: RCFGBuilder took 469.95ms. Allocated memory is still 307.2MB. Free memory was 272.5MB in the beginning and 258.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 02:40:59,816 INFO L158 Benchmark]: TraceAbstraction took 41263.47ms. Allocated memory is still 307.2MB. Free memory was 257.8MB in the beginning and 135.9MB in the end (delta: 121.9MB). Peak memory consumption was 164.4MB. Max. memory is 8.0GB. [2022-01-10 02:40:59,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.19ms. Allocated memory was 192.9MB in the beginning and 307.2MB in the end (delta: 114.3MB). Free memory was 134.9MB in the beginning and 275.6MB in the end (delta: -140.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.39ms. Allocated memory is still 307.2MB. Free memory was 275.6MB in the beginning and 274.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.37ms. Allocated memory is still 307.2MB. Free memory was 274.1MB in the beginning and 272.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 469.95ms. Allocated memory is still 307.2MB. Free memory was 272.5MB in the beginning and 258.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 41263.47ms. Allocated memory is still 307.2MB. Free memory was 257.8MB in the beginning and 135.9MB in the end (delta: 121.9MB). Peak memory consumption was 164.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 19, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4565 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4565 mSDsluCounter, 12919 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 11568 mSDsCounter, 818 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7994 IncrementalHoareTripleChecker+Invalid, 8819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 818 mSolverCounterUnsat, 1351 mSDtfsCounter, 7994 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2760 GetRequests, 2421 SyntacticMatches, 2 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2453 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=16, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 705 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 167 PreInvPairs, 655 NumberOfFragments, 123 HoareAnnotationTreeSize, 167 FomulaSimplifications, 16921 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 11529 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1481 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2498 ConstructedInterpolants, 1 QuantifiedInterpolants, 7165 SizeOfPredicates, 45 NumberOfNonLiveVariables, 2722 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 9191/11780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: !(\old(m) == 0bv32) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (4294967295bv32 == sa || (tmp == 1bv32 && sa == 1bv32)) || (__retres10 == 0bv32 && 0bv32 == zero) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (4294967295bv32 == sa || ((0bv32 == \result && __retres10 == 0bv32) && 0bv32 == zero)) || (tmp == 1bv32 && sa == 1bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((e == \old(e) && __retres4 == 0bv32) && m == ~bvshl32(~bvshl32(\old(m), 1bv32), 1bv32)) || !(\old(m) == 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: !(\old(m) == 0bv32) && (~bvult64(m, 16777216bv32) || !(\old(m) == 1bv32)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((!~bvsle32(e, 4294967168bv32) || !(\old(e) == 0bv32)) && !~bvult64(\old(m), 16777216bv32)) && (!~bvsle32(~bvadd16(4294967274bv32, e), 4294967168bv32) || !(\old(e) == 0bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 02:40:59,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...