/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 00:34:50,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 00:34:50,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 00:34:50,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 00:34:50,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 00:34:50,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 00:34:50,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 00:34:50,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 00:34:50,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 00:34:50,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 00:34:50,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 00:34:50,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 00:34:50,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 00:34:50,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 00:34:50,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 00:34:50,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 00:34:50,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 00:34:50,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 00:34:50,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 00:34:50,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 00:34:50,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 00:34:50,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 00:34:50,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 00:34:50,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 00:34:50,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 00:34:50,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 00:34:50,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 00:34:50,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 00:34:50,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 00:34:50,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 00:34:50,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 00:34:50,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 00:34:50,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 00:34:50,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 00:34:50,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 00:34:50,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 00:34:50,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 00:34:50,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 00:34:50,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 00:34:50,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 00:34:50,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 00:34:50,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-02-24 00:34:50,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 00:34:50,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 00:34:50,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-24 00:34:50,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-24 00:34:50,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-24 00:34:50,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-24 00:34:50,792 INFO L138 SettingsManager]: * Use SBE=true [2022-02-24 00:34:50,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 00:34:50,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 00:34:50,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 00:34:50,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 00:34:50,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 00:34:50,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 00:34:50,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 00:34:50,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 00:34:50,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 00:34:50,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 00:34:50,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 00:34:50,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 00:34:50,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:34:50,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 00:34:50,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-24 00:34:50,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-24 00:34:50,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-24 00:34:50,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-24 00:34:50,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 00:34:50,795 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-02-24 00:34:50,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-24 00:34:50,796 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-24 00:34:50,796 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-02-24 00:34:50,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 00:34:51,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 00:34:51,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 00:34:51,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 00:34:51,005 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 00:34:51,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-02-24 00:34:51,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d362f5e7a/254b49d6dc9d45098301d5e0a92b9c3f/FLAG13871bdc6 [2022-02-24 00:34:51,438 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 00:34:51,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-02-24 00:34:51,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d362f5e7a/254b49d6dc9d45098301d5e0a92b9c3f/FLAG13871bdc6 [2022-02-24 00:34:51,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d362f5e7a/254b49d6dc9d45098301d5e0a92b9c3f [2022-02-24 00:34:51,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 00:34:51,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-24 00:34:51,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 00:34:51,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 00:34:51,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 00:34:51,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656ce88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51, skipping insertion in model container [2022-02-24 00:34:51,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 00:34:51,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 00:34:51,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c[3901,3914] [2022-02-24 00:34:51,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:34:51,642 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 00:34:51,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c[3901,3914] [2022-02-24 00:34:51,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:34:51,675 INFO L208 MainTranslator]: Completed translation [2022-02-24 00:34:51,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51 WrapperNode [2022-02-24 00:34:51,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 00:34:51,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 00:34:51,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 00:34:51,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 00:34:51,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 00:34:51,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 00:34:51,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 00:34:51,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 00:34:51,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (1/1) ... [2022-02-24 00:34:51,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:34:51,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 00:34:51,744 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-02-24 00:34:51,757 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-02-24 00:34:51,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 00:34:51,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 00:34:51,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 00:34:51,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 00:34:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 00:34:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 00:34:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 00:34:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 00:34:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 00:34:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 00:34:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 00:34:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 00:34:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 00:34:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 00:34:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 00:34:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 00:34:51,867 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 00:34:51,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 00:34:52,065 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 00:34:52,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 00:34:52,070 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-24 00:34:52,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:34:52 BoogieIcfgContainer [2022-02-24 00:34:52,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 00:34:52,087 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-24 00:34:52,088 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-24 00:34:52,092 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-24 00:34:52,111 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:34:52" (1/1) ... [2022-02-24 00:34:52,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:34:52 BasicIcfg [2022-02-24 00:34:52,135 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-24 00:34:52,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 00:34:52,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 00:34:52,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 00:34:52,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:34:51" (1/4) ... [2022-02-24 00:34:52,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6397d5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:34:52, skipping insertion in model container [2022-02-24 00:34:52,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:34:51" (2/4) ... [2022-02-24 00:34:52,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6397d5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:34:52, skipping insertion in model container [2022-02-24 00:34:52,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:34:52" (3/4) ... [2022-02-24 00:34:52,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6397d5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:34:52, skipping insertion in model container [2022-02-24 00:34:52,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:34:52" (4/4) ... [2022-02-24 00:34:52,153 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.cqvasr [2022-02-24 00:34:52,157 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-24 00:34:52,157 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 00:34:52,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 00:34:52,201 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=FINITE_AUTOMATA, 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-02-24 00:34:52,201 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 00:34:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 00:34:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 00:34:52,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:52,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:52,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:52,224 INFO L85 PathProgramCache]: Analyzing trace with hash -666508425, now seen corresponding path program 1 times [2022-02-24 00:34:52,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:52,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068958482] [2022-02-24 00:34:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:52,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:52,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068958482] [2022-02-24 00:34:52,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068958482] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:52,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:52,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:52,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961565075] [2022-02-24 00:34:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:52,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:52,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:52,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:52,523 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:52,744 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-02-24 00:34:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:52,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-24 00:34:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:52,756 INFO L225 Difference]: With dead ends: 88 [2022-02-24 00:34:52,756 INFO L226 Difference]: Without dead ends: 73 [2022-02-24 00:34:52,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:52,761 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:52,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:34:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-24 00:34:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-02-24 00:34:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-02-24 00:34:52,809 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-02-24 00:34:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:52,810 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-02-24 00:34:52,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-02-24 00:34:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 00:34:52,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:52,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:52,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 00:34:52,812 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash -959911432, now seen corresponding path program 1 times [2022-02-24 00:34:52,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:52,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297936363] [2022-02-24 00:34:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:52,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:52,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297936363] [2022-02-24 00:34:52,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297936363] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:52,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:52,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:52,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834265566] [2022-02-24 00:34:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:52,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:52,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:52,875 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:52,992 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-02-24 00:34:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-24 00:34:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:52,996 INFO L225 Difference]: With dead ends: 118 [2022-02-24 00:34:52,996 INFO L226 Difference]: Without dead ends: 73 [2022-02-24 00:34:53,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,002 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-24 00:34:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-02-24 00:34:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-02-24 00:34:53,016 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-02-24 00:34:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,017 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-02-24 00:34:53,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-02-24 00:34:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 00:34:53,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 00:34:53,018 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 813107322, now seen corresponding path program 1 times [2022-02-24 00:34:53,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011545487] [2022-02-24 00:34:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011545487] [2022-02-24 00:34:53,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011545487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106136568] [2022-02-24 00:34:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,073 INFO L87 Difference]: Start difference. First operand 71 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,150 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-02-24 00:34:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-24 00:34:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,152 INFO L225 Difference]: With dead ends: 109 [2022-02-24 00:34:53,152 INFO L226 Difference]: Without dead ends: 76 [2022-02-24 00:34:53,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,153 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-24 00:34:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-02-24 00:34:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-02-24 00:34:53,161 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-02-24 00:34:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,161 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-02-24 00:34:53,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-02-24 00:34:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 00:34:53,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 00:34:53,163 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 307548697, now seen corresponding path program 1 times [2022-02-24 00:34:53,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365111339] [2022-02-24 00:34:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365111339] [2022-02-24 00:34:53,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365111339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261130801] [2022-02-24 00:34:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,210 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,302 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2022-02-24 00:34:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-24 00:34:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,303 INFO L225 Difference]: With dead ends: 137 [2022-02-24 00:34:53,303 INFO L226 Difference]: Without dead ends: 135 [2022-02-24 00:34:53,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,305 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-24 00:34:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-02-24 00:34:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 169 transitions. [2022-02-24 00:34:53,313 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 169 transitions. Word has length 22 [2022-02-24 00:34:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,313 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 169 transitions. [2022-02-24 00:34:53,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 169 transitions. [2022-02-24 00:34:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 00:34:53,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 00:34:53,315 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash 14145690, now seen corresponding path program 1 times [2022-02-24 00:34:53,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034298743] [2022-02-24 00:34:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034298743] [2022-02-24 00:34:53,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034298743] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655292363] [2022-02-24 00:34:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,366 INFO L87 Difference]: Start difference. First operand 97 states and 169 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,436 INFO L93 Difference]: Finished difference Result 225 states and 399 transitions. [2022-02-24 00:34:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-24 00:34:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,438 INFO L225 Difference]: With dead ends: 225 [2022-02-24 00:34:53,438 INFO L226 Difference]: Without dead ends: 137 [2022-02-24 00:34:53,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,440 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-24 00:34:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-02-24 00:34:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-02-24 00:34:53,448 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-02-24 00:34:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,448 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-02-24 00:34:53,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-02-24 00:34:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 00:34:53,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 00:34:53,450 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 944107156, now seen corresponding path program 1 times [2022-02-24 00:34:53,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060930156] [2022-02-24 00:34:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060930156] [2022-02-24 00:34:53,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060930156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474373733] [2022-02-24 00:34:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,538 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,606 INFO L93 Difference]: Finished difference Result 202 states and 350 transitions. [2022-02-24 00:34:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 00:34:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,608 INFO L225 Difference]: With dead ends: 202 [2022-02-24 00:34:53,608 INFO L226 Difference]: Without dead ends: 139 [2022-02-24 00:34:53,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,609 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 110 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-24 00:34:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-02-24 00:34:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 235 transitions. [2022-02-24 00:34:53,616 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 235 transitions. Word has length 23 [2022-02-24 00:34:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,617 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 235 transitions. [2022-02-24 00:34:53,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 235 transitions. [2022-02-24 00:34:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 00:34:53,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 00:34:53,618 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 438548531, now seen corresponding path program 1 times [2022-02-24 00:34:53,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828588214] [2022-02-24 00:34:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828588214] [2022-02-24 00:34:53,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828588214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684947541] [2022-02-24 00:34:53,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,654 INFO L87 Difference]: Start difference. First operand 137 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,721 INFO L93 Difference]: Finished difference Result 253 states and 441 transitions. [2022-02-24 00:34:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 00:34:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,723 INFO L225 Difference]: With dead ends: 253 [2022-02-24 00:34:53,723 INFO L226 Difference]: Without dead ends: 251 [2022-02-24 00:34:53,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,724 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-24 00:34:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 185. [2022-02-24 00:34:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 315 transitions. [2022-02-24 00:34:53,731 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 315 transitions. Word has length 23 [2022-02-24 00:34:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,732 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 315 transitions. [2022-02-24 00:34:53,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 315 transitions. [2022-02-24 00:34:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 00:34:53,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 00:34:53,733 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 145145524, now seen corresponding path program 1 times [2022-02-24 00:34:53,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804482443] [2022-02-24 00:34:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804482443] [2022-02-24 00:34:53,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804482443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543397079] [2022-02-24 00:34:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,766 INFO L87 Difference]: Start difference. First operand 185 states and 315 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,835 INFO L93 Difference]: Finished difference Result 433 states and 745 transitions. [2022-02-24 00:34:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 00:34:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,837 INFO L225 Difference]: With dead ends: 433 [2022-02-24 00:34:53,837 INFO L226 Difference]: Without dead ends: 259 [2022-02-24 00:34:53,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,838 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-02-24 00:34:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-02-24 00:34:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 435 transitions. [2022-02-24 00:34:53,846 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 435 transitions. Word has length 23 [2022-02-24 00:34:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,847 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 435 transitions. [2022-02-24 00:34:53,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 435 transitions. [2022-02-24 00:34:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 00:34:53,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 00:34:53,848 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash 710134838, now seen corresponding path program 1 times [2022-02-24 00:34:53,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285229459] [2022-02-24 00:34:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285229459] [2022-02-24 00:34:53,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285229459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462928979] [2022-02-24 00:34:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,880 INFO L87 Difference]: Start difference. First operand 257 states and 435 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:53,942 INFO L93 Difference]: Finished difference Result 385 states and 649 transitions. [2022-02-24 00:34:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-24 00:34:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:53,944 INFO L225 Difference]: With dead ends: 385 [2022-02-24 00:34:53,944 INFO L226 Difference]: Without dead ends: 263 [2022-02-24 00:34:53,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:53,945 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:53,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-02-24 00:34:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-02-24 00:34:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2022-02-24 00:34:53,952 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 24 [2022-02-24 00:34:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:53,953 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2022-02-24 00:34:53,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2022-02-24 00:34:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 00:34:53,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:53,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:53,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 00:34:53,954 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 204576213, now seen corresponding path program 1 times [2022-02-24 00:34:53,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:53,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989863322] [2022-02-24 00:34:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:53,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:53,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989863322] [2022-02-24 00:34:53,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989863322] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:53,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:53,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:53,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501002523] [2022-02-24 00:34:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:53,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:53,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:53,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:53,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:53,985 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,047 INFO L93 Difference]: Finished difference Result 477 states and 809 transitions. [2022-02-24 00:34:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-24 00:34:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,049 INFO L225 Difference]: With dead ends: 477 [2022-02-24 00:34:54,049 INFO L226 Difference]: Without dead ends: 475 [2022-02-24 00:34:54,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,050 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-02-24 00:34:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-02-24 00:34:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 591 transitions. [2022-02-24 00:34:54,059 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 591 transitions. Word has length 24 [2022-02-24 00:34:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,060 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 591 transitions. [2022-02-24 00:34:54,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 591 transitions. [2022-02-24 00:34:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 00:34:54,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 00:34:54,061 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -88826794, now seen corresponding path program 1 times [2022-02-24 00:34:54,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796713368] [2022-02-24 00:34:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796713368] [2022-02-24 00:34:54,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796713368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965115739] [2022-02-24 00:34:54,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,099 INFO L87 Difference]: Start difference. First operand 361 states and 591 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,165 INFO L93 Difference]: Finished difference Result 845 states and 1393 transitions. [2022-02-24 00:34:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-24 00:34:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,168 INFO L225 Difference]: With dead ends: 845 [2022-02-24 00:34:54,168 INFO L226 Difference]: Without dead ends: 499 [2022-02-24 00:34:54,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,169 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-02-24 00:34:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-02-24 00:34:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 807 transitions. [2022-02-24 00:34:54,183 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 807 transitions. Word has length 24 [2022-02-24 00:34:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,183 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 807 transitions. [2022-02-24 00:34:54,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 807 transitions. [2022-02-24 00:34:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 00:34:54,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 00:34:54,186 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2046927696, now seen corresponding path program 1 times [2022-02-24 00:34:54,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342939062] [2022-02-24 00:34:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342939062] [2022-02-24 00:34:54,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342939062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318323502] [2022-02-24 00:34:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,245 INFO L87 Difference]: Start difference. First operand 497 states and 807 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,311 INFO L93 Difference]: Finished difference Result 745 states and 1205 transitions. [2022-02-24 00:34:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-24 00:34:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,313 INFO L225 Difference]: With dead ends: 745 [2022-02-24 00:34:54,313 INFO L226 Difference]: Without dead ends: 507 [2022-02-24 00:34:54,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,314 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-02-24 00:34:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-02-24 00:34:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 807 transitions. [2022-02-24 00:34:54,327 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 807 transitions. Word has length 25 [2022-02-24 00:34:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,327 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 807 transitions. [2022-02-24 00:34:54,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 807 transitions. [2022-02-24 00:34:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 00:34:54,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 00:34:54,328 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1541369071, now seen corresponding path program 1 times [2022-02-24 00:34:54,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557599440] [2022-02-24 00:34:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557599440] [2022-02-24 00:34:54,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557599440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834406243] [2022-02-24 00:34:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,359 INFO L87 Difference]: Start difference. First operand 505 states and 807 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,427 INFO L93 Difference]: Finished difference Result 909 states and 1481 transitions. [2022-02-24 00:34:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-24 00:34:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,431 INFO L225 Difference]: With dead ends: 909 [2022-02-24 00:34:54,431 INFO L226 Difference]: Without dead ends: 907 [2022-02-24 00:34:54,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,432 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-02-24 00:34:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-02-24 00:34:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1111 transitions. [2022-02-24 00:34:54,450 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1111 transitions. Word has length 25 [2022-02-24 00:34:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,450 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 1111 transitions. [2022-02-24 00:34:54,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1111 transitions. [2022-02-24 00:34:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 00:34:54,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 00:34:54,452 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1247966064, now seen corresponding path program 1 times [2022-02-24 00:34:54,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007876898] [2022-02-24 00:34:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007876898] [2022-02-24 00:34:54,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007876898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970239126] [2022-02-24 00:34:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,480 INFO L87 Difference]: Start difference. First operand 713 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,575 INFO L93 Difference]: Finished difference Result 1661 states and 2601 transitions. [2022-02-24 00:34:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-24 00:34:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,579 INFO L225 Difference]: With dead ends: 1661 [2022-02-24 00:34:54,579 INFO L226 Difference]: Without dead ends: 971 [2022-02-24 00:34:54,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,580 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-02-24 00:34:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-02-24 00:34:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1495 transitions. [2022-02-24 00:34:54,603 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1495 transitions. Word has length 25 [2022-02-24 00:34:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,603 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1495 transitions. [2022-02-24 00:34:54,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1495 transitions. [2022-02-24 00:34:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-24 00:34:54,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 00:34:54,604 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 537833458, now seen corresponding path program 1 times [2022-02-24 00:34:54,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078463605] [2022-02-24 00:34:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078463605] [2022-02-24 00:34:54,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078463605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604272331] [2022-02-24 00:34:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,630 INFO L87 Difference]: Start difference. First operand 969 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,699 INFO L93 Difference]: Finished difference Result 1453 states and 2233 transitions. [2022-02-24 00:34:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-24 00:34:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,703 INFO L225 Difference]: With dead ends: 1453 [2022-02-24 00:34:54,703 INFO L226 Difference]: Without dead ends: 987 [2022-02-24 00:34:54,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,705 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-02-24 00:34:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-02-24 00:34:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1495 transitions. [2022-02-24 00:34:54,727 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1495 transitions. Word has length 26 [2022-02-24 00:34:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,728 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1495 transitions. [2022-02-24 00:34:54,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1495 transitions. [2022-02-24 00:34:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-24 00:34:54,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 00:34:54,729 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash 32274833, now seen corresponding path program 1 times [2022-02-24 00:34:54,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129878466] [2022-02-24 00:34:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129878466] [2022-02-24 00:34:54,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129878466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437893999] [2022-02-24 00:34:54,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,763 INFO L87 Difference]: Start difference. First operand 985 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:54,841 INFO L93 Difference]: Finished difference Result 1741 states and 2697 transitions. [2022-02-24 00:34:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:54,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-24 00:34:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:54,847 INFO L225 Difference]: With dead ends: 1741 [2022-02-24 00:34:54,847 INFO L226 Difference]: Without dead ends: 1739 [2022-02-24 00:34:54,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:54,848 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:54,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-02-24 00:34:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-02-24 00:34:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2087 transitions. [2022-02-24 00:34:54,882 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2087 transitions. Word has length 26 [2022-02-24 00:34:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:54,882 INFO L470 AbstractCegarLoop]: Abstraction has 1417 states and 2087 transitions. [2022-02-24 00:34:54,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2087 transitions. [2022-02-24 00:34:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-24 00:34:54,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:54,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:54,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 00:34:54,884 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash -261128174, now seen corresponding path program 1 times [2022-02-24 00:34:54,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:54,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882723914] [2022-02-24 00:34:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:54,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:54,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882723914] [2022-02-24 00:34:54,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882723914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:54,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:54,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:54,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040260630] [2022-02-24 00:34:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:54,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:54,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:54,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:54,914 INFO L87 Difference]: Start difference. First operand 1417 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:55,006 INFO L93 Difference]: Finished difference Result 3277 states and 4841 transitions. [2022-02-24 00:34:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:55,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-24 00:34:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:55,013 INFO L225 Difference]: With dead ends: 3277 [2022-02-24 00:34:55,013 INFO L226 Difference]: Without dead ends: 1899 [2022-02-24 00:34:55,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:55,016 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:55,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-02-24 00:34:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-02-24 00:34:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2759 transitions. [2022-02-24 00:34:55,071 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2759 transitions. Word has length 26 [2022-02-24 00:34:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:55,071 INFO L470 AbstractCegarLoop]: Abstraction has 1897 states and 2759 transitions. [2022-02-24 00:34:55,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2759 transitions. [2022-02-24 00:34:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-24 00:34:55,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:55,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:55,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 00:34:55,073 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1000552460, now seen corresponding path program 1 times [2022-02-24 00:34:55,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:55,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572915483] [2022-02-24 00:34:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:55,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:55,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572915483] [2022-02-24 00:34:55,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572915483] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:55,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:55,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:55,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175442630] [2022-02-24 00:34:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:55,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:55,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:55,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:55,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:55,099 INFO L87 Difference]: Start difference. First operand 1897 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:55,201 INFO L93 Difference]: Finished difference Result 2845 states and 4121 transitions. [2022-02-24 00:34:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:55,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-24 00:34:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:55,207 INFO L225 Difference]: With dead ends: 2845 [2022-02-24 00:34:55,207 INFO L226 Difference]: Without dead ends: 1931 [2022-02-24 00:34:55,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:55,208 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:55,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-02-24 00:34:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-02-24 00:34:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2759 transitions. [2022-02-24 00:34:55,253 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2759 transitions. Word has length 27 [2022-02-24 00:34:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:55,254 INFO L470 AbstractCegarLoop]: Abstraction has 1929 states and 2759 transitions. [2022-02-24 00:34:55,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2759 transitions. [2022-02-24 00:34:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-24 00:34:55,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:55,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:55,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-24 00:34:55,256 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash 494993835, now seen corresponding path program 1 times [2022-02-24 00:34:55,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:55,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873308977] [2022-02-24 00:34:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:55,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:55,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873308977] [2022-02-24 00:34:55,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873308977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:55,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:55,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:55,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130940072] [2022-02-24 00:34:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:55,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:55,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:55,292 INFO L87 Difference]: Start difference. First operand 1929 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:55,392 INFO L93 Difference]: Finished difference Result 3341 states and 4873 transitions. [2022-02-24 00:34:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-24 00:34:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:55,402 INFO L225 Difference]: With dead ends: 3341 [2022-02-24 00:34:55,403 INFO L226 Difference]: Without dead ends: 3339 [2022-02-24 00:34:55,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:55,404 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:55,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-02-24 00:34:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-02-24 00:34:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3911 transitions. [2022-02-24 00:34:55,494 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3911 transitions. Word has length 27 [2022-02-24 00:34:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:55,494 INFO L470 AbstractCegarLoop]: Abstraction has 2825 states and 3911 transitions. [2022-02-24 00:34:55,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3911 transitions. [2022-02-24 00:34:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-24 00:34:55,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:55,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:55,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-24 00:34:55,498 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 201590828, now seen corresponding path program 1 times [2022-02-24 00:34:55,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:55,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353901798] [2022-02-24 00:34:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:55,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:55,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353901798] [2022-02-24 00:34:55,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353901798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:55,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:55,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:55,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90288922] [2022-02-24 00:34:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:55,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:55,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:55,537 INFO L87 Difference]: Start difference. First operand 2825 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:55,648 INFO L93 Difference]: Finished difference Result 6477 states and 8969 transitions. [2022-02-24 00:34:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-24 00:34:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:55,661 INFO L225 Difference]: With dead ends: 6477 [2022-02-24 00:34:55,661 INFO L226 Difference]: Without dead ends: 3723 [2022-02-24 00:34:55,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:55,667 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:55,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-02-24 00:34:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-02-24 00:34:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5063 transitions. [2022-02-24 00:34:55,800 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5063 transitions. Word has length 27 [2022-02-24 00:34:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:55,800 INFO L470 AbstractCegarLoop]: Abstraction has 3721 states and 5063 transitions. [2022-02-24 00:34:55,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5063 transitions. [2022-02-24 00:34:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-24 00:34:55,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:55,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:55,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-24 00:34:55,804 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1835027538, now seen corresponding path program 1 times [2022-02-24 00:34:55,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:55,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056796938] [2022-02-24 00:34:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:55,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:55,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056796938] [2022-02-24 00:34:55,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056796938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:55,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:55,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:55,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249441247] [2022-02-24 00:34:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:55,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:55,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:55,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:55,833 INFO L87 Difference]: Start difference. First operand 3721 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:55,936 INFO L93 Difference]: Finished difference Result 5581 states and 7561 transitions. [2022-02-24 00:34:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:55,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-24 00:34:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:55,948 INFO L225 Difference]: With dead ends: 5581 [2022-02-24 00:34:55,948 INFO L226 Difference]: Without dead ends: 3787 [2022-02-24 00:34:55,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:55,951 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:55,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-02-24 00:34:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-02-24 00:34:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5063 transitions. [2022-02-24 00:34:56,044 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5063 transitions. Word has length 28 [2022-02-24 00:34:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:56,044 INFO L470 AbstractCegarLoop]: Abstraction has 3785 states and 5063 transitions. [2022-02-24 00:34:56,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5063 transitions. [2022-02-24 00:34:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-24 00:34:56,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:56,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:56,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-24 00:34:56,050 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1954381133, now seen corresponding path program 1 times [2022-02-24 00:34:56,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:56,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27418773] [2022-02-24 00:34:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:56,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:56,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27418773] [2022-02-24 00:34:56,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27418773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:56,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:56,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:56,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759528917] [2022-02-24 00:34:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:56,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:56,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:56,095 INFO L87 Difference]: Start difference. First operand 3785 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:56,213 INFO L93 Difference]: Finished difference Result 6413 states and 8713 transitions. [2022-02-24 00:34:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-24 00:34:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:56,245 INFO L225 Difference]: With dead ends: 6413 [2022-02-24 00:34:56,245 INFO L226 Difference]: Without dead ends: 6411 [2022-02-24 00:34:56,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:56,249 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:56,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-02-24 00:34:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-02-24 00:34:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7303 transitions. [2022-02-24 00:34:56,388 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7303 transitions. Word has length 28 [2022-02-24 00:34:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:56,388 INFO L470 AbstractCegarLoop]: Abstraction has 5641 states and 7303 transitions. [2022-02-24 00:34:56,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7303 transitions. [2022-02-24 00:34:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-24 00:34:56,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:56,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:56,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-24 00:34:56,395 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1660978126, now seen corresponding path program 1 times [2022-02-24 00:34:56,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:56,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817240100] [2022-02-24 00:34:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:56,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:56,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817240100] [2022-02-24 00:34:56,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817240100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:56,418 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:56,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:56,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134106699] [2022-02-24 00:34:56,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:56,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:56,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:56,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:56,419 INFO L87 Difference]: Start difference. First operand 5641 states and 7303 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:56,571 INFO L93 Difference]: Finished difference Result 12813 states and 16521 transitions. [2022-02-24 00:34:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-02-24 00:34:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:56,584 INFO L225 Difference]: With dead ends: 12813 [2022-02-24 00:34:56,584 INFO L226 Difference]: Without dead ends: 7307 [2022-02-24 00:34:56,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:56,595 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:56,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-02-24 00:34:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-02-24 00:34:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9223 transitions. [2022-02-24 00:34:56,792 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9223 transitions. Word has length 28 [2022-02-24 00:34:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:56,792 INFO L470 AbstractCegarLoop]: Abstraction has 7305 states and 9223 transitions. [2022-02-24 00:34:56,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9223 transitions. [2022-02-24 00:34:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 00:34:56,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:56,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:56,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-24 00:34:56,800 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash 456305864, now seen corresponding path program 1 times [2022-02-24 00:34:56,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:56,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532015366] [2022-02-24 00:34:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:56,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:56,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532015366] [2022-02-24 00:34:56,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532015366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:56,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:56,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:56,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964721691] [2022-02-24 00:34:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:56,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:56,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:56,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:56,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:56,841 INFO L87 Difference]: Start difference. First operand 7305 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:56,989 INFO L93 Difference]: Finished difference Result 10957 states and 13769 transitions. [2022-02-24 00:34:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-24 00:34:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:57,002 INFO L225 Difference]: With dead ends: 10957 [2022-02-24 00:34:57,003 INFO L226 Difference]: Without dead ends: 7435 [2022-02-24 00:34:57,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:57,010 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:57,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-02-24 00:34:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-02-24 00:34:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9223 transitions. [2022-02-24 00:34:57,205 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9223 transitions. Word has length 29 [2022-02-24 00:34:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:57,205 INFO L470 AbstractCegarLoop]: Abstraction has 7433 states and 9223 transitions. [2022-02-24 00:34:57,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9223 transitions. [2022-02-24 00:34:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 00:34:57,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:57,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:57,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-24 00:34:57,214 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash -49252761, now seen corresponding path program 1 times [2022-02-24 00:34:57,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:57,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936925835] [2022-02-24 00:34:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:57,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:57,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:57,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936925835] [2022-02-24 00:34:57,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936925835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:57,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:57,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:57,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247152312] [2022-02-24 00:34:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:57,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:57,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:57,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:57,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:57,243 INFO L87 Difference]: Start difference. First operand 7433 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:57,444 INFO L93 Difference]: Finished difference Result 12301 states and 15369 transitions. [2022-02-24 00:34:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-24 00:34:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:57,467 INFO L225 Difference]: With dead ends: 12301 [2022-02-24 00:34:57,468 INFO L226 Difference]: Without dead ends: 12299 [2022-02-24 00:34:57,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:57,474 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:57,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-02-24 00:34:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-02-24 00:34:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13575 transitions. [2022-02-24 00:34:57,755 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13575 transitions. Word has length 29 [2022-02-24 00:34:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:57,756 INFO L470 AbstractCegarLoop]: Abstraction has 11273 states and 13575 transitions. [2022-02-24 00:34:57,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13575 transitions. [2022-02-24 00:34:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 00:34:57,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:57,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:57,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-24 00:34:57,771 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash -342655768, now seen corresponding path program 1 times [2022-02-24 00:34:57,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:57,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375410088] [2022-02-24 00:34:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:57,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:57,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375410088] [2022-02-24 00:34:57,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375410088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:57,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:57,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:57,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608746466] [2022-02-24 00:34:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:57,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:57,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:57,795 INFO L87 Difference]: Start difference. First operand 11273 states and 13575 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:58,063 INFO L93 Difference]: Finished difference Result 25357 states and 30217 transitions. [2022-02-24 00:34:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-24 00:34:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:58,091 INFO L225 Difference]: With dead ends: 25357 [2022-02-24 00:34:58,092 INFO L226 Difference]: Without dead ends: 14347 [2022-02-24 00:34:58,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:58,113 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:58,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-02-24 00:34:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-02-24 00:34:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 16647 transitions. [2022-02-24 00:34:58,438 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 16647 transitions. Word has length 29 [2022-02-24 00:34:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:58,438 INFO L470 AbstractCegarLoop]: Abstraction has 14345 states and 16647 transitions. [2022-02-24 00:34:58,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 16647 transitions. [2022-02-24 00:34:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-24 00:34:58,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:58,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:58,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-24 00:34:58,454 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1526802582, now seen corresponding path program 1 times [2022-02-24 00:34:58,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:58,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654646441] [2022-02-24 00:34:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:58,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:58,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654646441] [2022-02-24 00:34:58,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654646441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:58,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:58,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:58,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49153628] [2022-02-24 00:34:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:58,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:58,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:58,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:58,477 INFO L87 Difference]: Start difference. First operand 14345 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:58,733 INFO L93 Difference]: Finished difference Result 21517 states and 24841 transitions. [2022-02-24 00:34:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:58,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-24 00:34:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:58,757 INFO L225 Difference]: With dead ends: 21517 [2022-02-24 00:34:58,757 INFO L226 Difference]: Without dead ends: 14603 [2022-02-24 00:34:58,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:58,770 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:58,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:34:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-02-24 00:34:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-02-24 00:34:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16647 transitions. [2022-02-24 00:34:59,044 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16647 transitions. Word has length 30 [2022-02-24 00:34:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:59,045 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 16647 transitions. [2022-02-24 00:34:59,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16647 transitions. [2022-02-24 00:34:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-24 00:34:59,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:59,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:59,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-24 00:34:59,063 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2032361207, now seen corresponding path program 1 times [2022-02-24 00:34:59,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:59,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485327583] [2022-02-24 00:34:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:59,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:59,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485327583] [2022-02-24 00:34:59,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485327583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:59,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:59,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:59,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10226547] [2022-02-24 00:34:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:59,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:59,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:59,086 INFO L87 Difference]: Start difference. First operand 14601 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:34:59,375 INFO L93 Difference]: Finished difference Result 23563 states and 26632 transitions. [2022-02-24 00:34:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:34:59,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-24 00:34:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:34:59,421 INFO L225 Difference]: With dead ends: 23563 [2022-02-24 00:34:59,421 INFO L226 Difference]: Without dead ends: 23561 [2022-02-24 00:34:59,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:34:59,428 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:34:59,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 68 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 00:34:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23561 states. [2022-02-24 00:34:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23561 to 22537. [2022-02-24 00:34:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 25095 transitions. [2022-02-24 00:34:59,925 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 25095 transitions. Word has length 30 [2022-02-24 00:34:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:34:59,926 INFO L470 AbstractCegarLoop]: Abstraction has 22537 states and 25095 transitions. [2022-02-24 00:34:59,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:34:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 25095 transitions. [2022-02-24 00:34:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-24 00:34:59,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:34:59,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:34:59,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-24 00:34:59,958 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:34:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:34:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1969203082, now seen corresponding path program 1 times [2022-02-24 00:34:59,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:34:59,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291343465] [2022-02-24 00:34:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:34:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:34:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:34:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:34:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:34:59,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:34:59,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291343465] [2022-02-24 00:34:59,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291343465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:34:59,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:34:59,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-24 00:34:59,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023381552] [2022-02-24 00:34:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:34:59,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-24 00:34:59,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:34:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-24 00:34:59,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-24 00:34:59,989 INFO L87 Difference]: Start difference. First operand 22537 states and 25095 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:35:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:35:00,421 INFO L93 Difference]: Finished difference Result 50185 states and 54791 transitions. [2022-02-24 00:35:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-24 00:35:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-24 00:35:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:35:00,422 INFO L225 Difference]: With dead ends: 50185 [2022-02-24 00:35:00,422 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 00:35:00,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-24 00:35:00,573 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 112 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-02-24 00:35:00,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 112 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 00:35:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 00:35:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 00:35:00,574 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-02-24 00:35:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 00:35:00,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-02-24 00:35:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:35:00,575 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 00:35:00,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 00:35:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 00:35:00,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 00:35:00,578 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 00:35:00,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-24 00:35:00,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 00:37:45,796 WARN L232 SmtUtils]: Spent 2.75m on a formula simplification that was a NOOP. DAG size: 4152 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-24 00:37:45,839 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 00:37:45,839 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-02-24 00:37:45,839 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-02-24 00:37:45,839 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 00:37:45,839 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 00:37:45,839 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-24 00:37:45,839 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-24 00:37:45,839 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 6 165) the Hoare annotation is: true [2022-02-24 00:37:45,839 INFO L861 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2022-02-24 00:37:45,840 INFO L861 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 6 165) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 6 165) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,840 INFO L858 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L854 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-02-24 00:37:45,841 INFO L858 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2022-02-24 00:37:45,842 INFO L858 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2022-02-24 00:37:45,845 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:37:45,846 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 00:37:45,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:37:45 BasicIcfg [2022-02-24 00:37:45,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 00:37:45,855 INFO L158 Benchmark]: Toolchain (without parser) took 174389.57ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 882.9MB). Free memory was 148.4MB in the beginning and 446.2MB in the end (delta: -297.8MB). Peak memory consumption was 810.0MB. Max. memory is 8.0GB. [2022-02-24 00:37:45,855 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 133.3MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 00:37:45,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.09ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 148.2MB in the beginning and 222.2MB in the end (delta: -74.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-02-24 00:37:45,858 INFO L158 Benchmark]: Boogie Preprocessor took 26.15ms. Allocated memory is still 251.7MB. Free memory was 222.2MB in the beginning and 220.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-24 00:37:45,858 INFO L158 Benchmark]: RCFGBuilder took 367.43ms. Allocated memory is still 251.7MB. Free memory was 220.7MB in the beginning and 208.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-24 00:37:45,858 INFO L158 Benchmark]: IcfgTransformer took 47.41ms. Allocated memory is still 251.7MB. Free memory was 208.1MB in the beginning and 206.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 00:37:45,859 INFO L158 Benchmark]: TraceAbstraction took 173718.13ms. Allocated memory was 251.7MB in the beginning and 1.1GB in the end (delta: 805.3MB). Free memory was 206.0MB in the beginning and 446.2MB in the end (delta: -240.2MB). Peak memory consumption was 791.2MB. Max. memory is 8.0GB. [2022-02-24 00:37:45,864 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.13ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 133.3MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.09ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 148.2MB in the beginning and 222.2MB in the end (delta: -74.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.15ms. Allocated memory is still 251.7MB. Free memory was 222.2MB in the beginning and 220.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 367.43ms. Allocated memory is still 251.7MB. Free memory was 220.7MB in the beginning and 208.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 47.41ms. Allocated memory is still 251.7MB. Free memory was 208.1MB in the beginning and 206.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 173718.13ms. Allocated memory was 251.7MB in the beginning and 1.1GB in the end (delta: 805.3MB). Free memory was 206.0MB in the beginning and 446.2MB in the end (delta: -240.2MB). Peak memory consumption was 791.2MB. 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: 163]: 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 173.7s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 165.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3720 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3720 mSDsluCounter, 2693 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2488 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22537occurred in iteration=28, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 4126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 165.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 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: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-24 00:37:45,891 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...