/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/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 06:09:56,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 06:09:56,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 06:09:56,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 06:09:56,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 06:09:56,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 06:09:56,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 06:09:56,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 06:09:56,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 06:09:56,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 06:09:56,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 06:09:56,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 06:09:56,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 06:09:56,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 06:09:56,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 06:09:56,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 06:09:56,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 06:09:56,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 06:09:57,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 06:09:57,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 06:09:57,005 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 06:09:57,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 06:09:57,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 06:09:57,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 06:09:57,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 06:09:57,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 06:09:57,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 06:09:57,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 06:09:57,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 06:09:57,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 06:09:57,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 06:09:57,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 06:09:57,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 06:09:57,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 06:09:57,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 06:09:57,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 06:09:57,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 06:09:57,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 06:09:57,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 06:09:57,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 06:09:57,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 06:09:57,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 06:09:57,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 06:09:57,040 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 06:09:57,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 06:09:57,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 06:09:57,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 06:09:57,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 06:09:57,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 06:09:57,041 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 06:09:57,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 06:09:57,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 06:09:57,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 06:09:57,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 06:09:57,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 06:09:57,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 06:09:57,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 06:09:57,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:09:57,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 06:09:57,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 06:09:57,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 06:09:57,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 06:09:57,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 06:09:57,044 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 06:09:57,044 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-04-05 06:09:57,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 06:09:57,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 06:09:57,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 06:09:57,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 06:09:57,238 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 06:09:57,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-05 06:09:57,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059149990/719ecb2a11994faeb5001722fe78733e/FLAGc5af05410 [2022-04-05 06:09:57,614 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 06:09:57,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-05 06:09:57,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059149990/719ecb2a11994faeb5001722fe78733e/FLAGc5af05410 [2022-04-05 06:09:57,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059149990/719ecb2a11994faeb5001722fe78733e [2022-04-05 06:09:57,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 06:09:57,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 06:09:57,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 06:09:57,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 06:09:57,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 06:09:57,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a562225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57, skipping insertion in model container [2022-04-05 06:09:57,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 06:09:57,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 06:09:57,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-04-05 06:09:57,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:09:57,837 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 06:09:57,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-04-05 06:09:57,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:09:57,865 INFO L208 MainTranslator]: Completed translation [2022-04-05 06:09:57,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57 WrapperNode [2022-04-05 06:09:57,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 06:09:57,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 06:09:57,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 06:09:57,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 06:09:57,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 06:09:57,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 06:09:57,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 06:09:57,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 06:09:57,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (1/1) ... [2022-04-05 06:09:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:09:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:09:57,924 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-04-05 06:09:57,944 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-04-05 06:09:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 06:09:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 06:09:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 06:09:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 06:09:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 06:09:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 06:09:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 06:09:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 06:09:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 06:09:57,991 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 06:09:57,992 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 06:09:58,102 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 06:09:58,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 06:09:58,106 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-05 06:09:58,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:09:58 BoogieIcfgContainer [2022-04-05 06:09:58,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 06:09:58,108 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 06:09:58,108 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 06:09:58,108 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 06:09:58,111 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:09:58" (1/1) ... [2022-04-05 06:09:58,112 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 06:09:58,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:09:58 BasicIcfg [2022-04-05 06:09:58,123 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 06:09:58,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 06:09:58,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 06:09:58,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 06:09:58,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:09:57" (1/4) ... [2022-04-05 06:09:58,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb4564f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:09:58, skipping insertion in model container [2022-04-05 06:09:58,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:09:57" (2/4) ... [2022-04-05 06:09:58,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb4564f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:09:58, skipping insertion in model container [2022-04-05 06:09:58,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:09:58" (3/4) ... [2022-04-05 06:09:58,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb4564f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:09:58, skipping insertion in model container [2022-04-05 06:09:58,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:09:58" (4/4) ... [2022-04-05 06:09:58,150 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.cqvasr [2022-04-05 06:09:58,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 06:09:58,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 06:09:58,198 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 06:09:58,204 INFO L340 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 [2022-04-05 06:09:58,204 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 06:09:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 06:09:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-05 06:09:58,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:09:58,227 INFO L499 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-04-05 06:09:58,228 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:09:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:09:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash -414317756, now seen corresponding path program 1 times [2022-04-05 06:09:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:09:58,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885213964] [2022-04-05 06:09:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:09:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:09:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:09:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:58,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:09:58,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885213964] [2022-04-05 06:09:58,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885213964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:09:58,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:09:58,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 06:09:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080745188] [2022-04-05 06:09:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:09:58,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 06:09:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 06:09:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 06:09:58,427 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:09:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:09:58,501 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-05 06:09:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 06:09:58,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-05 06:09:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:09:58,513 INFO L225 Difference]: With dead ends: 50 [2022-04-05 06:09:58,513 INFO L226 Difference]: Without dead ends: 27 [2022-04-05 06:09:58,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 06:09:58,519 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:09:58,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:09:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-05 06:09:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-05 06:09:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:09:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-05 06:09:58,550 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-04-05 06:09:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:09:58,551 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-05 06:09:58,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:09:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-05 06:09:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-05 06:09:58,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:09:58,553 INFO L499 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-04-05 06:09:58,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 06:09:58,554 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:09:58,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:09:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1035089572, now seen corresponding path program 1 times [2022-04-05 06:09:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:09:58,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325312356] [2022-04-05 06:09:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:09:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:09:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:09:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:58,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:09:58,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325312356] [2022-04-05 06:09:58,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325312356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:09:58,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:09:58,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 06:09:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258749827] [2022-04-05 06:09:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:09:58,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 06:09:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 06:09:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:09:58,658 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:09:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:09:58,719 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-05 06:09:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 06:09:58,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-05 06:09:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:09:58,721 INFO L225 Difference]: With dead ends: 46 [2022-04-05 06:09:58,721 INFO L226 Difference]: Without dead ends: 31 [2022-04-05 06:09:58,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:09:58,722 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:09:58,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 26 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:09:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-05 06:09:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-05 06:09:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:09:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-05 06:09:58,731 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-04-05 06:09:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:09:58,731 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-05 06:09:58,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:09:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-05 06:09:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-05 06:09:58,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:09:58,733 INFO L499 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-04-05 06:09:58,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 06:09:58,733 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:09:58,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:09:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2124918270, now seen corresponding path program 1 times [2022-04-05 06:09:58,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:09:58,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735242921] [2022-04-05 06:09:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:09:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:09:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:09:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-05 06:09:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:09:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735242921] [2022-04-05 06:09:58,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735242921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:09:58,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:09:58,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 06:09:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896825919] [2022-04-05 06:09:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:09:58,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 06:09:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 06:09:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:09:58,789 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:09:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:09:58,834 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-05 06:09:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 06:09:58,834 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-05 06:09:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:09:58,836 INFO L225 Difference]: With dead ends: 49 [2022-04-05 06:09:58,836 INFO L226 Difference]: Without dead ends: 33 [2022-04-05 06:09:58,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:09:58,837 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 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-04-05 06:09:58,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:09:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-05 06:09:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-04-05 06:09:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:09:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-05 06:09:58,846 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-04-05 06:09:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:09:58,847 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-05 06:09:58,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:09:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-05 06:09:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-05 06:09:58,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:09:58,849 INFO L499 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-04-05 06:09:58,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 06:09:58,849 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:09:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:09:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1237414589, now seen corresponding path program 1 times [2022-04-05 06:09:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:09:58,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048130733] [2022-04-05 06:09:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:09:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:09:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:09:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-05 06:09:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:09:58,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048130733] [2022-04-05 06:09:58,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048130733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:09:58,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:09:58,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 06:09:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112173368] [2022-04-05 06:09:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:09:58,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 06:09:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 06:09:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:09:58,928 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:09:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:09:59,021 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-05 06:09:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 06:09:59,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-05 06:09:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:09:59,022 INFO L225 Difference]: With dead ends: 57 [2022-04-05 06:09:59,022 INFO L226 Difference]: Without dead ends: 40 [2022-04-05 06:09:59,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:09:59,023 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:09:59,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 37 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:09:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-05 06:09:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-05 06:09:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 06:09:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-05 06:09:59,029 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2022-04-05 06:09:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:09:59,029 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-04-05 06:09:59,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:09:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-04-05 06:09:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-05 06:09:59,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:09:59,030 INFO L499 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-04-05 06:09:59,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 06:09:59,030 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:09:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:09:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1236491068, now seen corresponding path program 1 times [2022-04-05 06:09:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:09:59,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294007583] [2022-04-05 06:09:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:09:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:09:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:09:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:09:59,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294007583] [2022-04-05 06:09:59,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294007583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:09:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839190312] [2022-04-05 06:09:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:09:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:09:59,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:09:59,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 06:09:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-05 06:09:59,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:09:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:59,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:09:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:59,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839190312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:09:59,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:09:59,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-05 06:09:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943386368] [2022-04-05 06:09:59,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:09:59,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 06:09:59,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:59,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 06:09:59,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-05 06:09:59,310 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:09:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:09:59,418 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-05 06:09:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 06:09:59,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2022-04-05 06:09:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:09:59,419 INFO L225 Difference]: With dead ends: 87 [2022-04-05 06:09:59,420 INFO L226 Difference]: Without dead ends: 59 [2022-04-05 06:09:59,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:09:59,421 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:09:59,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 30 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:09:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-05 06:09:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-05 06:09:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-05 06:09:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-05 06:09:59,426 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 24 [2022-04-05 06:09:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:09:59,427 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-05 06:09:59,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:09:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-05 06:09:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-05 06:09:59,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:09:59,427 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:09:59,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 06:09:59,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:09:59,646 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:09:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:09:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 575066086, now seen corresponding path program 2 times [2022-04-05 06:09:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:09:59,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426228420] [2022-04-05 06:09:59,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:09:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:09:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:09:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:09:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:09:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:09:59,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426228420] [2022-04-05 06:09:59,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426228420] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:09:59,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13451701] [2022-04-05 06:09:59,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:09:59,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:09:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:09:59,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:09:59,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 06:09:59,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:09:59,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:09:59,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-05 06:09:59,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:09:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 06:09:59,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:09:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-05 06:09:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13451701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:09:59,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:09:59,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-04-05 06:09:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189176681] [2022-04-05 06:09:59,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:09:59,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 06:09:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 06:09:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-05 06:09:59,929 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 06:10:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:00,222 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2022-04-05 06:10:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-05 06:10:00,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-04-05 06:10:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:00,223 INFO L225 Difference]: With dead ends: 183 [2022-04-05 06:10:00,223 INFO L226 Difference]: Without dead ends: 137 [2022-04-05 06:10:00,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2022-04-05 06:10:00,224 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:00,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 44 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:10:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-05 06:10:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2022-04-05 06:10:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 113 states have internal predecessors, (152), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-05 06:10:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-04-05 06:10:00,236 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 33 [2022-04-05 06:10:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:00,236 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-04-05 06:10:00,237 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 06:10:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2022-04-05 06:10:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-05 06:10:00,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:00,237 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:00,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:00,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-05 06:10:00,454 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1861776890, now seen corresponding path program 1 times [2022-04-05 06:10:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:00,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486122488] [2022-04-05 06:10:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-05 06:10:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:00,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486122488] [2022-04-05 06:10:00,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486122488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:10:00,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:10:00,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 06:10:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610673546] [2022-04-05 06:10:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:10:00,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 06:10:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:00,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 06:10:00,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:10:00,511 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:10:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:00,556 INFO L93 Difference]: Finished difference Result 281 states and 380 transitions. [2022-04-05 06:10:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 06:10:00,557 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-04-05 06:10:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:00,559 INFO L225 Difference]: With dead ends: 281 [2022-04-05 06:10:00,560 INFO L226 Difference]: Without dead ends: 169 [2022-04-05 06:10:00,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:10:00,563 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:00,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 53 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:10:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-05 06:10:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2022-04-05 06:10:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 147 states have internal predecessors, (194), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-05 06:10:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2022-04-05 06:10:00,589 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 39 [2022-04-05 06:10:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:00,589 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2022-04-05 06:10:00,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:10:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2022-04-05 06:10:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-05 06:10:00,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:00,590 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:00,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 06:10:00,590 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:00,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1695849177, now seen corresponding path program 1 times [2022-04-05 06:10:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:00,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262959036] [2022-04-05 06:10:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:00,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262959036] [2022-04-05 06:10:00,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262959036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:00,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827360113] [2022-04-05 06:10:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:00,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:00,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:00,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 06:10:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:00,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 06:10:00,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:01,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:01,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827360113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:01,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:01,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-04-05 06:10:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287328422] [2022-04-05 06:10:01,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:01,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 06:10:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:01,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 06:10:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-04-05 06:10:01,162 INFO L87 Difference]: Start difference. First operand 158 states and 207 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:10:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:01,382 INFO L93 Difference]: Finished difference Result 449 states and 643 transitions. [2022-04-05 06:10:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 06:10:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-05 06:10:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:01,384 INFO L225 Difference]: With dead ends: 449 [2022-04-05 06:10:01,384 INFO L226 Difference]: Without dead ends: 303 [2022-04-05 06:10:01,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=723, Unknown=0, NotChecked=0, Total=1122 [2022-04-05 06:10:01,388 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 197 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:01,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 29 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:10:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-05 06:10:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2022-04-05 06:10:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 290 states have (on average 1.3310344827586207) internal successors, (386), 291 states have internal predecessors, (386), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-05 06:10:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2022-04-05 06:10:01,409 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 40 [2022-04-05 06:10:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:01,409 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2022-04-05 06:10:01,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:10:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2022-04-05 06:10:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-05 06:10:01,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:01,416 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:01,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:01,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:01,629 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash 150253017, now seen corresponding path program 2 times [2022-04-05 06:10:01,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:01,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340722677] [2022-04-05 06:10:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:01,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340722677] [2022-04-05 06:10:01,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340722677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:01,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499338509] [2022-04-05 06:10:01,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:10:01,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:01,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:01,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 06:10:01,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:10:01,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:10:01,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 06:10:01,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-05 06:10:02,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-05 06:10:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499338509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:02,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:02,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 26 [2022-04-05 06:10:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969805844] [2022-04-05 06:10:02,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:02,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 06:10:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 06:10:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2022-04-05 06:10:02,257 INFO L87 Difference]: Start difference. First operand 302 states and 399 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:10:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:03,297 INFO L93 Difference]: Finished difference Result 1401 states and 1897 transitions. [2022-04-05 06:10:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-05 06:10:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 64 [2022-04-05 06:10:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:03,302 INFO L225 Difference]: With dead ends: 1401 [2022-04-05 06:10:03,302 INFO L226 Difference]: Without dead ends: 1111 [2022-04-05 06:10:03,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1752, Invalid=4568, Unknown=0, NotChecked=0, Total=6320 [2022-04-05 06:10:03,305 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 693 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:03,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 33 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:10:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-04-05 06:10:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 482. [2022-04-05 06:10:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 464 states have (on average 1.331896551724138) internal successors, (618), 465 states have internal predecessors, (618), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 06:10:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 639 transitions. [2022-04-05 06:10:03,331 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 639 transitions. Word has length 64 [2022-04-05 06:10:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:03,332 INFO L478 AbstractCegarLoop]: Abstraction has 482 states and 639 transitions. [2022-04-05 06:10:03,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:10:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 639 transitions. [2022-04-05 06:10:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-05 06:10:03,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:03,333 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:03,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:03,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:03,550 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -110856328, now seen corresponding path program 1 times [2022-04-05 06:10:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:03,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726254668] [2022-04-05 06:10:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726254668] [2022-04-05 06:10:03,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726254668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126155884] [2022-04-05 06:10:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:03,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:03,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:03,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 06:10:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:03,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-05 06:10:03,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:04,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:04,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126155884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:04,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:04,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-04-05 06:10:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829839648] [2022-04-05 06:10:04,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:04,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-05 06:10:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-05 06:10:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=1058, Unknown=0, NotChecked=0, Total=1722 [2022-04-05 06:10:04,359 INFO L87 Difference]: Start difference. First operand 482 states and 639 transitions. Second operand has 42 states, 42 states have (on average 3.1666666666666665) internal successors, (133), 41 states have internal predecessors, (133), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:10:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:04,649 INFO L93 Difference]: Finished difference Result 2103 states and 2809 transitions. [2022-04-05 06:10:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-05 06:10:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.1666666666666665) internal successors, (133), 41 states have internal predecessors, (133), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2022-04-05 06:10:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:04,654 INFO L225 Difference]: With dead ends: 2103 [2022-04-05 06:10:04,655 INFO L226 Difference]: Without dead ends: 1633 [2022-04-05 06:10:04,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=744, Invalid=1326, Unknown=0, NotChecked=0, Total=2070 [2022-04-05 06:10:04,656 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 223 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:04,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 32 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:10:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-04-05 06:10:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 590. [2022-04-05 06:10:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 572 states have (on average 1.3251748251748252) internal successors, (758), 573 states have internal predecessors, (758), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 06:10:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 779 transitions. [2022-04-05 06:10:04,688 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 779 transitions. Word has length 70 [2022-04-05 06:10:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:04,688 INFO L478 AbstractCegarLoop]: Abstraction has 590 states and 779 transitions. [2022-04-05 06:10:04,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.1666666666666665) internal successors, (133), 41 states have internal predecessors, (133), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-05 06:10:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 779 transitions. [2022-04-05 06:10:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-05 06:10:04,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:04,689 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:04,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:04,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-05 06:10:04,908 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash 906232056, now seen corresponding path program 2 times [2022-04-05 06:10:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:04,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492067887] [2022-04-05 06:10:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:05,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:05,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492067887] [2022-04-05 06:10:05,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492067887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:05,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871497900] [2022-04-05 06:10:05,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:10:05,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:05,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:05,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 06:10:05,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:10:05,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:10:05,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 06:10:05,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-04-05 06:10:05,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 06:10:05,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871497900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:10:05,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:10:05,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2022-04-05 06:10:05,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317307427] [2022-04-05 06:10:05,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:10:05,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 06:10:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 06:10:05,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=841, Unknown=0, NotChecked=0, Total=1122 [2022-04-05 06:10:05,639 INFO L87 Difference]: Start difference. First operand 590 states and 779 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:10:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:05,702 INFO L93 Difference]: Finished difference Result 593 states and 781 transitions. [2022-04-05 06:10:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 06:10:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2022-04-05 06:10:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:05,704 INFO L225 Difference]: With dead ends: 593 [2022-04-05 06:10:05,704 INFO L226 Difference]: Without dead ends: 453 [2022-04-05 06:10:05,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2022-04-05 06:10:05,705 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:05,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:10:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-05 06:10:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2022-04-05 06:10:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 437 states have (on average 1.3157894736842106) internal successors, (575), 438 states have internal predecessors, (575), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-05 06:10:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 592 transitions. [2022-04-05 06:10:05,722 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 592 transitions. Word has length 82 [2022-04-05 06:10:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:05,723 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 592 transitions. [2022-04-05 06:10:05,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-05 06:10:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 592 transitions. [2022-04-05 06:10:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-05 06:10:05,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:05,723 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:05,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:05,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:05,941 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash -764281513, now seen corresponding path program 1 times [2022-04-05 06:10:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:05,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121165376] [2022-04-05 06:10:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:06,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121165376] [2022-04-05 06:10:06,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121165376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:06,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443922810] [2022-04-05 06:10:06,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:06,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:06,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:06,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:06,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-05 06:10:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:06,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-05 06:10:06,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:07,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:10:09,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443922810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:09,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:09,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 77 [2022-04-05 06:10:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68265489] [2022-04-05 06:10:09,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:09,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-05 06:10:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:09,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-05 06:10:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=4271, Unknown=0, NotChecked=0, Total=5852 [2022-04-05 06:10:09,230 INFO L87 Difference]: Start difference. First operand 452 states and 592 transitions. Second operand has 77 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 74 states have internal predecessors, (212), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 06:10:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:11,273 INFO L93 Difference]: Finished difference Result 909 states and 1209 transitions. [2022-04-05 06:10:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-04-05 06:10:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 74 states have internal predecessors, (212), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 82 [2022-04-05 06:10:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:11,277 INFO L225 Difference]: With dead ends: 909 [2022-04-05 06:10:11,277 INFO L226 Difference]: Without dead ends: 907 [2022-04-05 06:10:11,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6247 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3458, Invalid=12544, Unknown=0, NotChecked=0, Total=16002 [2022-04-05 06:10:11,280 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 516 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:11,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 63 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 06:10:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-05 06:10:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 862. [2022-04-05 06:10:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 835 states have (on average 1.3269461077844311) internal successors, (1108), 841 states have internal predecessors, (1108), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (17), 11 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-05 06:10:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1143 transitions. [2022-04-05 06:10:11,316 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1143 transitions. Word has length 82 [2022-04-05 06:10:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:11,317 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1143 transitions. [2022-04-05 06:10:11,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.7532467532467533) internal successors, (212), 74 states have internal predecessors, (212), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 06:10:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1143 transitions. [2022-04-05 06:10:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-05 06:10:11,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:11,321 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:11,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:11,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:11,537 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2101920920, now seen corresponding path program 1 times [2022-04-05 06:10:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:11,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335654818] [2022-04-05 06:10:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-04-05 06:10:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335654818] [2022-04-05 06:10:11,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335654818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:10:11,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:10:11,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 06:10:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008977057] [2022-04-05 06:10:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:10:11,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 06:10:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 06:10:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 06:10:11,596 INFO L87 Difference]: Start difference. First operand 862 states and 1143 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:10:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:11,706 INFO L93 Difference]: Finished difference Result 1330 states and 1770 transitions. [2022-04-05 06:10:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 06:10:11,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2022-04-05 06:10:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:11,711 INFO L225 Difference]: With dead ends: 1330 [2022-04-05 06:10:11,711 INFO L226 Difference]: Without dead ends: 1103 [2022-04-05 06:10:11,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:10:11,712 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:11,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 42 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:10:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-04-05 06:10:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 937. [2022-04-05 06:10:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 908 states have (on average 1.327092511013216) internal successors, (1205), 915 states have internal predecessors, (1205), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (19), 12 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-05 06:10:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1244 transitions. [2022-04-05 06:10:11,764 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1244 transitions. Word has length 82 [2022-04-05 06:10:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:11,764 INFO L478 AbstractCegarLoop]: Abstraction has 937 states and 1244 transitions. [2022-04-05 06:10:11,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 06:10:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1244 transitions. [2022-04-05 06:10:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-05 06:10:11,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:11,766 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:11,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 06:10:11,766 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1670302378, now seen corresponding path program 1 times [2022-04-05 06:10:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:11,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274837364] [2022-04-05 06:10:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-05 06:10:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-04-05 06:10:11,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274837364] [2022-04-05 06:10:11,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274837364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304011324] [2022-04-05 06:10:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:11,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:11,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-05 06:10:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:11,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 06:10:11,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-04-05 06:10:12,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 3 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-04-05 06:10:12,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304011324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:12,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:12,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-05 06:10:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902317518] [2022-04-05 06:10:12,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:12,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 06:10:12,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:12,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 06:10:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:10:12,607 INFO L87 Difference]: Start difference. First operand 937 states and 1244 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-05 06:10:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:12,800 INFO L93 Difference]: Finished difference Result 2294 states and 3080 transitions. [2022-04-05 06:10:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 06:10:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 153 [2022-04-05 06:10:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:12,806 INFO L225 Difference]: With dead ends: 2294 [2022-04-05 06:10:12,806 INFO L226 Difference]: Without dead ends: 2067 [2022-04-05 06:10:12,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-04-05 06:10:12,808 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 220 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:12,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 86 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:10:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-04-05 06:10:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1237. [2022-04-05 06:10:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1200 states have (on average 1.3275) internal successors, (1593), 1211 states have internal predecessors, (1593), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (27), 16 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-05 06:10:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2022-04-05 06:10:12,865 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 153 [2022-04-05 06:10:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:12,866 INFO L478 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2022-04-05 06:10:12,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-05 06:10:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2022-04-05 06:10:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-05 06:10:12,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:12,871 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 39, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:12,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:13,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-05 06:10:13,072 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1910464549, now seen corresponding path program 1 times [2022-04-05 06:10:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:13,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844196228] [2022-04-05 06:10:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:13,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-05 06:10:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 722 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-04-05 06:10:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844196228] [2022-04-05 06:10:13,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844196228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:13,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808675442] [2022-04-05 06:10:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:13,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:13,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:13,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:13,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-05 06:10:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:13,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-05 06:10:13,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1960 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-04-05 06:10:14,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 06:10:14,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808675442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:10:14,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:10:14,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [25] total 46 [2022-04-05 06:10:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111757705] [2022-04-05 06:10:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:10:14,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-05 06:10:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-05 06:10:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-04-05 06:10:14,234 INFO L87 Difference]: Start difference. First operand 1237 states and 1648 transitions. Second operand has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 06:10:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:14,421 INFO L93 Difference]: Finished difference Result 2246 states and 2982 transitions. [2022-04-05 06:10:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-05 06:10:14,422 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 156 [2022-04-05 06:10:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:14,424 INFO L225 Difference]: With dead ends: 2246 [2022-04-05 06:10:14,424 INFO L226 Difference]: Without dead ends: 928 [2022-04-05 06:10:14,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-04-05 06:10:14,427 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:14,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 62 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:10:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-04-05 06:10:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 866. [2022-04-05 06:10:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 842 states have (on average 1.165083135391924) internal successors, (981), 843 states have internal predecessors, (981), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-05 06:10:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1010 transitions. [2022-04-05 06:10:14,463 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1010 transitions. Word has length 156 [2022-04-05 06:10:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:14,463 INFO L478 AbstractCegarLoop]: Abstraction has 866 states and 1010 transitions. [2022-04-05 06:10:14,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 23 states have internal predecessors, (92), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 06:10:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1010 transitions. [2022-04-05 06:10:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-05 06:10:14,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:14,467 INFO L499 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:14,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:14,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-05 06:10:14,684 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1004247254, now seen corresponding path program 2 times [2022-04-05 06:10:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100764516] [2022-04-05 06:10:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-05 06:10:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-04-05 06:10:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-04-05 06:10:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-04-05 06:10:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-04-05 06:10:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-04-05 06:10:14,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:14,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100764516] [2022-04-05 06:10:14,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100764516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:14,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833974925] [2022-04-05 06:10:14,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:10:14,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:14,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:14,935 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:14,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-05 06:10:15,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:10:15,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:10:15,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 06:10:15,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-04-05 06:10:16,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2022-04-05 06:10:17,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833974925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:17,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:17,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-04-05 06:10:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939483170] [2022-04-05 06:10:17,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:17,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 06:10:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 06:10:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2022-04-05 06:10:17,003 INFO L87 Difference]: Start difference. First operand 866 states and 1010 transitions. Second operand has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 19 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) [2022-04-05 06:10:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:17,400 INFO L93 Difference]: Finished difference Result 2797 states and 3552 transitions. [2022-04-05 06:10:17,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 06:10:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 19 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) Word has length 437 [2022-04-05 06:10:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:17,404 INFO L225 Difference]: With dead ends: 2797 [2022-04-05 06:10:17,404 INFO L226 Difference]: Without dead ends: 1402 [2022-04-05 06:10:17,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=723, Unknown=0, NotChecked=0, Total=1122 [2022-04-05 06:10:17,407 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 397 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:17,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 155 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:10:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-04-05 06:10:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2022-04-05 06:10:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1370 states have (on average 1.1072992700729927) internal successors, (1517), 1371 states have internal predecessors, (1517), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-05 06:10:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1562 transitions. [2022-04-05 06:10:17,478 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1562 transitions. Word has length 437 [2022-04-05 06:10:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:17,479 INFO L478 AbstractCegarLoop]: Abstraction has 1402 states and 1562 transitions. [2022-04-05 06:10:17,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 25 states have internal predecessors, (187), 19 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 17 states have call predecessors, (20), 18 states have call successors, (20) [2022-04-05 06:10:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1562 transitions. [2022-04-05 06:10:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2022-04-05 06:10:17,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:17,498 INFO L499 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:17,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-05 06:10:17,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-05 06:10:17,715 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1775263786, now seen corresponding path program 3 times [2022-04-05 06:10:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:17,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516856270] [2022-04-05 06:10:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:10:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:10:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-05 06:10:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-04-05 06:10:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-04-05 06:10:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-04-05 06:10:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-04-05 06:10:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-04-05 06:10:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2022-04-05 06:10:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2022-04-05 06:10:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2022-04-05 06:10:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-04-05 06:10:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2022-04-05 06:10:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2022-04-05 06:10:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2022-04-05 06:10:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:10:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-04-05 06:10:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:10:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516856270] [2022-04-05 06:10:18,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516856270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:10:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672392109] [2022-04-05 06:10:18,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 06:10:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:10:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:10:18,171 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:10:18,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-05 06:10:18,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2022-04-05 06:10:18,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:10:18,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-05 06:10:18,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:10:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-04-05 06:10:21,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:10:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2022-04-05 06:10:22,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672392109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:10:22,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:10:22,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 40 [2022-04-05 06:10:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819591413] [2022-04-05 06:10:22,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:10:22,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-05 06:10:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:10:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-05 06:10:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=946, Unknown=0, NotChecked=0, Total=1560 [2022-04-05 06:10:22,998 INFO L87 Difference]: Start difference. First operand 1402 states and 1562 transitions. Second operand has 40 states, 40 states have (on average 8.075) internal successors, (323), 39 states have internal predecessors, (323), 35 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) [2022-04-05 06:10:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:10:23,434 INFO L93 Difference]: Finished difference Result 2907 states and 3542 transitions. [2022-04-05 06:10:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-05 06:10:23,434 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 8.075) internal successors, (323), 39 states have internal predecessors, (323), 35 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) Word has length 1005 [2022-04-05 06:10:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:10:23,442 INFO L225 Difference]: With dead ends: 2907 [2022-04-05 06:10:23,442 INFO L226 Difference]: Without dead ends: 1804 [2022-04-05 06:10:23,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2063 GetRequests, 2018 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=744, Invalid=1326, Unknown=0, NotChecked=0, Total=2070 [2022-04-05 06:10:23,446 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 447 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:10:23,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 216 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:10:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-04-05 06:10:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-04-05 06:10:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1766 states have (on average 1.0866364665911665) internal successors, (1919), 1767 states have internal predecessors, (1919), 29 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-05 06:10:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 1976 transitions. [2022-04-05 06:10:23,566 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 1976 transitions. Word has length 1005 [2022-04-05 06:10:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:10:23,567 INFO L478 AbstractCegarLoop]: Abstraction has 1804 states and 1976 transitions. [2022-04-05 06:10:23,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.075) internal successors, (323), 39 states have internal predecessors, (323), 35 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) [2022-04-05 06:10:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 1976 transitions. [2022-04-05 06:10:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2022-04-05 06:10:23,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:10:23,583 INFO L499 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:23,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-05 06:10:23,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-05 06:10:23,808 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:10:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:10:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash 942669078, now seen corresponding path program 4 times [2022-04-05 06:10:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:10:23,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980175380] [2022-04-05 06:10:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:10:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:10:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 06:10:24,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-05 06:10:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 06:10:24,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-05 06:10:24,879 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-05 06:10:24,880 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 06:10:24,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 06:10:24,883 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:10:24,886 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 06:10:25,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:10:25 BasicIcfg [2022-04-05 06:10:25,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 06:10:25,092 INFO L158 Benchmark]: Toolchain (without parser) took 27455.08ms. Allocated memory was 175.1MB in the beginning and 531.6MB in the end (delta: 356.5MB). Free memory was 116.8MB in the beginning and 444.0MB in the end (delta: -327.2MB). Peak memory consumption was 293.9MB. Max. memory is 8.0GB. [2022-04-05 06:10:25,092 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 06:10:25,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.32ms. Allocated memory was 175.1MB in the beginning and 254.8MB in the end (delta: 79.7MB). Free memory was 116.7MB in the beginning and 226.9MB in the end (delta: -110.2MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-05 06:10:25,093 INFO L158 Benchmark]: Boogie Preprocessor took 30.33ms. Allocated memory is still 254.8MB. Free memory was 226.9MB in the beginning and 225.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 06:10:25,093 INFO L158 Benchmark]: RCFGBuilder took 208.63ms. Allocated memory is still 254.8MB. Free memory was 225.3MB in the beginning and 213.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-05 06:10:25,093 INFO L158 Benchmark]: IcfgTransformer took 15.75ms. Allocated memory is still 254.8MB. Free memory was 213.3MB in the beginning and 211.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 06:10:25,093 INFO L158 Benchmark]: TraceAbstraction took 26966.60ms. Allocated memory was 254.8MB in the beginning and 531.6MB in the end (delta: 276.8MB). Free memory was 211.2MB in the beginning and 444.0MB in the end (delta: -232.8MB). Peak memory consumption was 307.9MB. Max. memory is 8.0GB. [2022-04-05 06:10:25,098 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.09ms. Allocated memory is still 175.1MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.32ms. Allocated memory was 175.1MB in the beginning and 254.8MB in the end (delta: 79.7MB). Free memory was 116.7MB in the beginning and 226.9MB in the end (delta: -110.2MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.33ms. Allocated memory is still 254.8MB. Free memory was 226.9MB in the beginning and 225.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 208.63ms. Allocated memory is still 254.8MB. Free memory was 225.3MB in the beginning and 213.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.75ms. Allocated memory is still 254.8MB. Free memory was 213.3MB in the beginning and 211.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 26966.60ms. Allocated memory was 254.8MB in the beginning and 531.6MB in the end (delta: 276.8MB). Free memory was 211.2MB in the beginning and 444.0MB in the end (delta: -232.8MB). Peak memory consumption was 307.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [\old(last)=50, \old(SIZE)=51, last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L6] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L21] RET assume_abort_if_not(last > 0) VAL [\old(last)=0, last=21, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=21, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=20, d=0, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=21, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=40, b=40, c=20, d=20, last=21, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [\old(last)=0, a=0, b=1, c=20, d=20, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=0, \old(last)=0, last=21, SIZE=20] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(last)=0, cond=0, last=21, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, \old(last)=0, cond=0, last=21, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3227 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3202 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 790 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3090 IncrementalHoareTripleChecker+Invalid, 3880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 790 mSolverCounterUnsat, 418 mSDtfsCounter, 3090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4521 GetRequests, 4008 SyntacticMatches, 6 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10995 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=17, InterpolantAutomatonStates: 327, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 2809 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 5934 NumberOfCodeBlocks, 5469 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 6374 ConstructedInterpolants, 0 QuantifiedInterpolants, 35321 SizeOfPredicates, 29 NumberOfNonLiveVariables, 3501 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 37 InterpolantComputations, 8 PerfectInterpolantSequences, 45824/451303 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-05 06:10:25,127 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...