/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/nla-digbench-scaling/cohencu-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 09:29:10,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 09:29:10,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 09:29:10,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 09:29:10,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 09:29:10,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 09:29:10,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 09:29:10,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 09:29:10,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 09:29:10,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 09:29:10,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 09:29:10,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 09:29:10,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 09:29:10,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 09:29:10,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 09:29:10,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 09:29:10,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 09:29:10,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 09:29:10,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 09:29:10,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 09:29:10,225 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 09:29:10,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 09:29:10,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 09:29:10,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 09:29:10,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 09:29:10,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 09:29:10,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 09:29:10,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 09:29:10,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 09:29:10,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 09:29:10,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 09:29:10,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 09:29:10,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 09:29:10,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 09:29:10,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 09:29:10,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 09:29:10,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 09:29:10,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 09:29:10,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 09:29:10,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 09:29:10,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 09:29:10,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 09:29:10,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-20 09:29:10,271 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 09:29:10,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 09:29:10,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 09:29:10,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 09:29:10,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 09:29:10,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 09:29:10,275 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 09:29:10,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 09:29:10,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 09:29:10,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 09:29:10,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 09:29:10,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 09:29:10,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 09:29:10,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 09:29:10,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 09:29:10,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 09:29:10,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 09:29:10,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 09:29:10,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 09:29:10,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 09:29:10,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-20 09:29:10,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-20 09:29:10,279 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 09:29:10,279 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-03-20 09:29:10,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 09:29:10,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 09:29:10,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 09:29:10,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 09:29:10,541 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 09:29:10,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-20 09:29:10,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43aab5d10/ad27dd61fdae41d0afd21263b4f07dd0/FLAGb613161b3 [2022-03-20 09:29:10,984 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 09:29:10,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-20 09:29:10,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43aab5d10/ad27dd61fdae41d0afd21263b4f07dd0/FLAGb613161b3 [2022-03-20 09:29:11,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43aab5d10/ad27dd61fdae41d0afd21263b4f07dd0 [2022-03-20 09:29:11,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 09:29:11,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 09:29:11,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 09:29:11,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 09:29:11,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 09:29:11,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d54e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11, skipping insertion in model container [2022-03-20 09:29:11,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 09:29:11,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 09:29:11,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c[588,601] [2022-03-20 09:29:11,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 09:29:11,201 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 09:29:11,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c[588,601] [2022-03-20 09:29:11,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 09:29:11,241 INFO L208 MainTranslator]: Completed translation [2022-03-20 09:29:11,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11 WrapperNode [2022-03-20 09:29:11,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 09:29:11,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 09:29:11,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 09:29:11,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 09:29:11,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 09:29:11,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 09:29:11,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 09:29:11,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 09:29:11,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 09:29:11,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:11,316 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-03-20 09:29:11,321 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-03-20 09:29:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 09:29:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 09:29:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 09:29:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 09:29:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 09:29:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 09:29:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 09:29:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 09:29:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 09:29:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 09:29:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-03-20 09:29:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 09:29:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 09:29:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 09:29:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 09:29:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 09:29:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 09:29:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 09:29:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 09:29:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 09:29:11,422 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 09:29:11,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 09:29:11,592 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 09:29:11,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 09:29:11,597 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 09:29:11,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:29:11 BoogieIcfgContainer [2022-03-20 09:29:11,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 09:29:11,599 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 09:29:11,599 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 09:29:11,599 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 09:29:11,610 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:29:11" (1/1) ... [2022-03-20 09:29:11,611 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-03-20 09:29:11,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 09:29:11 BasicIcfg [2022-03-20 09:29:11,635 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 09:29:11,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 09:29:11,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 09:29:11,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 09:29:11,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 09:29:11" (1/4) ... [2022-03-20 09:29:11,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6bd5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 09:29:11, skipping insertion in model container [2022-03-20 09:29:11,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:29:11" (2/4) ... [2022-03-20 09:29:11,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6bd5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 09:29:11, skipping insertion in model container [2022-03-20 09:29:11,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:29:11" (3/4) ... [2022-03-20 09:29:11,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6bd5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 09:29:11, skipping insertion in model container [2022-03-20 09:29:11,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 09:29:11" (4/4) ... [2022-03-20 09:29:11,650 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.cqvasr [2022-03-20 09:29:11,654 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 09:29:11,654 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 09:29:11,711 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 09:29:11,718 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-03-20 09:29:11,718 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 09:29:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-20 09:29:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 09:29:11,743 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:11,744 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:11,744 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-03-20 09:29:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:11,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983860044] [2022-03-20 09:29:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:29:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 09:29:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:11,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983860044] [2022-03-20 09:29:11,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983860044] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:29:11,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:29:11,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 09:29:11,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582505046] [2022-03-20 09:29:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:29:11,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 09:29:11,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 09:29:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 09:29:11,989 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 09:29:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:12,116 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-03-20 09:29:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 09:29:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 09:29:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:12,124 INFO L225 Difference]: With dead ends: 57 [2022-03-20 09:29:12,124 INFO L226 Difference]: Without dead ends: 27 [2022-03-20 09:29:12,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-20 09:29:12,131 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:12,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-20 09:29:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-03-20 09:29:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-20 09:29:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-03-20 09:29:12,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-03-20 09:29:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:12,161 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-03-20 09:29:12,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 09:29:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-03-20 09:29:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-20 09:29:12,161 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:12,162 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:12,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 09:29:12,162 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-03-20 09:29:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:12,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722073315] [2022-03-20 09:29:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:29:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 09:29:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722073315] [2022-03-20 09:29:12,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722073315] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:29:12,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:29:12,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 09:29:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514866186] [2022-03-20 09:29:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:29:12,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 09:29:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 09:29:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 09:29:12,231 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 09:29:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:12,309 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-03-20 09:29:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 09:29:12,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-03-20 09:29:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:12,311 INFO L225 Difference]: With dead ends: 40 [2022-03-20 09:29:12,311 INFO L226 Difference]: Without dead ends: 28 [2022-03-20 09:29:12,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 09:29:12,313 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:12,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-20 09:29:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-03-20 09:29:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-20 09:29:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-03-20 09:29:12,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-03-20 09:29:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:12,321 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-03-20 09:29:12,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 09:29:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-03-20 09:29:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-20 09:29:12,322 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:12,322 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:12,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 09:29:12,322 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:12,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-03-20 09:29:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:12,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752472714] [2022-03-20 09:29:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:12,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 09:29:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 09:29:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:12,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752472714] [2022-03-20 09:29:12,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752472714] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:29:12,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:29:12,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 09:29:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589021566] [2022-03-20 09:29:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:29:12,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 09:29:12,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:12,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 09:29:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 09:29:12,444 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 09:29:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:12,578 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-03-20 09:29:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 09:29:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-03-20 09:29:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:12,582 INFO L225 Difference]: With dead ends: 34 [2022-03-20 09:29:12,582 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 09:29:12,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 09:29:12,588 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:12,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 09:29:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-20 09:29:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-20 09:29:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-03-20 09:29:12,598 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-03-20 09:29:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:12,598 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-03-20 09:29:12,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 09:29:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-03-20 09:29:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 09:29:12,599 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:12,599 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:12,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 09:29:12,599 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:12,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-03-20 09:29:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:12,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790191976] [2022-03-20 09:29:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:12,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:12,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901942523] [2022-03-20 09:29:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:12,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:12,614 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-03-20 09:29:12,622 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-03-20 09:29:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:12,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 09:29:12,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 09:29:12,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 09:29:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790191976] [2022-03-20 09:29:12,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:12,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901942523] [2022-03-20 09:29:12,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901942523] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:29:12,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:29:12,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 09:29:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359143192] [2022-03-20 09:29:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:29:12,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 09:29:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 09:29:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 09:29:12,767 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 09:29:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:12,823 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-03-20 09:29:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 09:29:12,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-03-20 09:29:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:12,827 INFO L225 Difference]: With dead ends: 50 [2022-03-20 09:29:12,828 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 09:29:12,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 09:29:12,835 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:12,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 159 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 09:29:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 09:29:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-03-20 09:29:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-03-20 09:29:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-03-20 09:29:12,855 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-03-20 09:29:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:12,856 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-03-20 09:29:12,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 09:29:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-03-20 09:29:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 09:29:12,857 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:12,857 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:12,880 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-03-20 09:29:13,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:13,072 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-03-20 09:29:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:13,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691319316] [2022-03-20 09:29:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:13,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:13,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405786685] [2022-03-20 09:29:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:13,095 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-03-20 09:29:13,106 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-03-20 09:29:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:13,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 09:29:13,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 09:29:13,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 09:29:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691319316] [2022-03-20 09:29:13,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:13,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405786685] [2022-03-20 09:29:13,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405786685] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:29:13,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:29:13,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 09:29:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932303033] [2022-03-20 09:29:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:29:13,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 09:29:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 09:29:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 09:29:13,245 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 09:29:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:13,312 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-03-20 09:29:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 09:29:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-03-20 09:29:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:13,315 INFO L225 Difference]: With dead ends: 54 [2022-03-20 09:29:13,315 INFO L226 Difference]: Without dead ends: 52 [2022-03-20 09:29:13,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 09:29:13,317 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:13,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 159 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 09:29:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-20 09:29:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-03-20 09:29:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-20 09:29:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-03-20 09:29:13,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-03-20 09:29:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:13,336 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-03-20 09:29:13,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 09:29:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-03-20 09:29:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 09:29:13,337 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:13,337 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:13,364 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-03-20 09:29:13,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:13,559 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-03-20 09:29:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476818719] [2022-03-20 09:29:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:13,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:13,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233544364] [2022-03-20 09:29:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:13,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:13,576 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-03-20 09:29:13,595 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-03-20 09:29:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:13,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 09:29:13,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 09:29:13,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 09:29:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:13,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476818719] [2022-03-20 09:29:13,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:13,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233544364] [2022-03-20 09:29:13,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233544364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 09:29:13,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 09:29:13,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 09:29:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705790145] [2022-03-20 09:29:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 09:29:13,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 09:29:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 09:29:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 09:29:13,745 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 09:29:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:13,802 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-03-20 09:29:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 09:29:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-03-20 09:29:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:13,803 INFO L225 Difference]: With dead ends: 62 [2022-03-20 09:29:13,803 INFO L226 Difference]: Without dead ends: 50 [2022-03-20 09:29:13,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 09:29:13,804 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:13,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 157 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 09:29:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-20 09:29:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-03-20 09:29:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-03-20 09:29:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-03-20 09:29:13,812 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-03-20 09:29:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:13,812 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-03-20 09:29:13,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 09:29:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-03-20 09:29:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 09:29:13,813 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:13,814 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:13,839 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-03-20 09:29:14,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:14,037 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-03-20 09:29:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:14,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708597358] [2022-03-20 09:29:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:14,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:14,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640459203] [2022-03-20 09:29:14,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:14,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:14,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:14,051 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-03-20 09:29:14,056 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-03-20 09:29:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:14,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 09:29:14,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-20 09:29:14,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 09:29:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:14,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708597358] [2022-03-20 09:29:14,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:14,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640459203] [2022-03-20 09:29:14,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640459203] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:14,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:14,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-03-20 09:29:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065403806] [2022-03-20 09:29:14,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:14,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 09:29:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 09:29:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-20 09:29:14,326 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-03-20 09:29:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:14,453 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-03-20 09:29:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 09:29:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-03-20 09:29:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:14,456 INFO L225 Difference]: With dead ends: 120 [2022-03-20 09:29:14,456 INFO L226 Difference]: Without dead ends: 104 [2022-03-20 09:29:14,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-20 09:29:14,460 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 58 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:14,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-20 09:29:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-03-20 09:29:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-20 09:29:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-03-20 09:29:14,491 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-03-20 09:29:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:14,491 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-03-20 09:29:14,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-03-20 09:29:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-03-20 09:29:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 09:29:14,494 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:14,494 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:14,522 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-03-20 09:29:14,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:14,710 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-03-20 09:29:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:14,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254429325] [2022-03-20 09:29:14,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:14,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31353304] [2022-03-20 09:29:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:14,722 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-03-20 09:29:14,750 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-03-20 09:29:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 09:29:14,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 09:29:14,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 09:29:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:15,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254429325] [2022-03-20 09:29:15,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:15,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31353304] [2022-03-20 09:29:15,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31353304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:15,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:15,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 09:29:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275048537] [2022-03-20 09:29:15,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:15,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 09:29:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 09:29:15,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 09:29:15,053 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-20 09:29:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:15,328 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-03-20 09:29:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 09:29:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-03-20 09:29:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:15,330 INFO L225 Difference]: With dead ends: 118 [2022-03-20 09:29:15,330 INFO L226 Difference]: Without dead ends: 116 [2022-03-20 09:29:15,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-20 09:29:15,331 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:15,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:29:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-20 09:29:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-03-20 09:29:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-20 09:29:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-03-20 09:29:15,371 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-03-20 09:29:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:15,372 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-03-20 09:29:15,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-20 09:29:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-03-20 09:29:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 09:29:15,377 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:15,377 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:15,402 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-03-20 09:29:15,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:15,600 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-03-20 09:29:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:15,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556096659] [2022-03-20 09:29:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:15,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:15,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083583069] [2022-03-20 09:29:15,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 09:29:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:15,611 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-03-20 09:29:15,615 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-03-20 09:29:15,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 09:29:15,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 09:29:15,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-03-20 09:29:15,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-03-20 09:29:15,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:15,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556096659] [2022-03-20 09:29:15,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:15,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083583069] [2022-03-20 09:29:15,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083583069] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:15,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:15,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 09:29:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049074533] [2022-03-20 09:29:15,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:15,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 09:29:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:15,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 09:29:15,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 09:29:15,941 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-03-20 09:29:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:16,030 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-03-20 09:29:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 09:29:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-03-20 09:29:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:16,035 INFO L225 Difference]: With dead ends: 122 [2022-03-20 09:29:16,036 INFO L226 Difference]: Without dead ends: 120 [2022-03-20 09:29:16,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-03-20 09:29:16,039 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:16,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 263 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-03-20 09:29:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-03-20 09:29:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-20 09:29:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-03-20 09:29:16,066 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-03-20 09:29:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:16,066 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-03-20 09:29:16,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-03-20 09:29:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-03-20 09:29:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-20 09:29:16,070 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:16,070 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:16,095 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-03-20 09:29:16,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:16,295 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-03-20 09:29:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710570808] [2022-03-20 09:29:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:16,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:16,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858511156] [2022-03-20 09:29:16,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 09:29:16,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:16,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:16,307 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-03-20 09:29:16,311 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-03-20 09:29:16,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-20 09:29:16,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:16,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-20 09:29:16,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-20 09:29:16,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-20 09:29:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710570808] [2022-03-20 09:29:16,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858511156] [2022-03-20 09:29:16,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858511156] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:16,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:16,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 09:29:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712007581] [2022-03-20 09:29:16,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:16,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 09:29:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:16,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 09:29:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 09:29:16,794 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-03-20 09:29:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:17,000 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-03-20 09:29:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 09:29:17,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-03-20 09:29:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:17,001 INFO L225 Difference]: With dead ends: 146 [2022-03-20 09:29:17,001 INFO L226 Difference]: Without dead ends: 135 [2022-03-20 09:29:17,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 09:29:17,002 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:17,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 168 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:29:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-03-20 09:29:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-03-20 09:29:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-20 09:29:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-03-20 09:29:17,018 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-03-20 09:29:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:17,018 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-03-20 09:29:17,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-03-20 09:29:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-03-20 09:29:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-20 09:29:17,019 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:17,019 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:17,044 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-03-20 09:29:17,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:17,239 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-03-20 09:29:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436232400] [2022-03-20 09:29:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:17,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772126190] [2022-03-20 09:29:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:17,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:17,250 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-03-20 09:29:17,253 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-03-20 09:29:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:17,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-20 09:29:17,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-03-20 09:29:18,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-03-20 09:29:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436232400] [2022-03-20 09:29:18,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772126190] [2022-03-20 09:29:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772126190] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:18,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:18,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-03-20 09:29:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81407040] [2022-03-20 09:29:18,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:18,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 09:29:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 09:29:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-20 09:29:18,341 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-03-20 09:29:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:18,586 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-03-20 09:29:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 09:29:18,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-03-20 09:29:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:18,588 INFO L225 Difference]: With dead ends: 148 [2022-03-20 09:29:18,588 INFO L226 Difference]: Without dead ends: 144 [2022-03-20 09:29:18,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-20 09:29:18,589 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:18,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 254 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-20 09:29:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-03-20 09:29:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-20 09:29:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-03-20 09:29:18,608 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-03-20 09:29:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:18,609 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-03-20 09:29:18,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-03-20 09:29:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-03-20 09:29:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 09:29:18,609 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:18,610 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:18,639 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-03-20 09:29:18,823 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,SelfDestructingSolverStorable10 [2022-03-20 09:29:18,824 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-03-20 09:29:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:18,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366659672] [2022-03-20 09:29:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:18,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326972790] [2022-03-20 09:29:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:18,835 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-03-20 09:29:18,848 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-03-20 09:29:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 09:29:18,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 09:29:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-03-20 09:29:19,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:19,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366659672] [2022-03-20 09:29:19,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326972790] [2022-03-20 09:29:19,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326972790] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:29:19,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 09:29:19,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-03-20 09:29:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697283389] [2022-03-20 09:29:19,424 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:19,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 09:29:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:19,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 09:29:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-20 09:29:19,425 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-03-20 09:29:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:19,525 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-03-20 09:29:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 09:29:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-03-20 09:29:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:19,527 INFO L225 Difference]: With dead ends: 143 [2022-03-20 09:29:19,527 INFO L226 Difference]: Without dead ends: 132 [2022-03-20 09:29:19,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 09:29:19,528 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:19,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-20 09:29:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-03-20 09:29:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-20 09:29:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-03-20 09:29:19,549 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-03-20 09:29:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:19,549 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-03-20 09:29:19,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-03-20 09:29:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-03-20 09:29:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 09:29:19,550 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:19,550 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:19,573 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-03-20 09:29:19,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:19,763 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-03-20 09:29:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:19,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199835492] [2022-03-20 09:29:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:19,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:19,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831190711] [2022-03-20 09:29:19,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 09:29:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:19,774 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-03-20 09:29:19,782 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-03-20 09:29:22,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 09:29:22,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:22,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-20 09:29:22,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-03-20 09:29:22,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-03-20 09:29:22,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:22,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199835492] [2022-03-20 09:29:22,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:22,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831190711] [2022-03-20 09:29:22,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831190711] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:22,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:22,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-03-20 09:29:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791736837] [2022-03-20 09:29:22,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:22,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 09:29:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:22,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 09:29:22,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-03-20 09:29:22,990 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-03-20 09:29:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:23,112 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-03-20 09:29:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 09:29:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-03-20 09:29:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:23,129 INFO L225 Difference]: With dead ends: 142 [2022-03-20 09:29:23,129 INFO L226 Difference]: Without dead ends: 138 [2022-03-20 09:29:23,129 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-20 09:29:23,130 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:23,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 88 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-20 09:29:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-03-20 09:29:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-20 09:29:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-03-20 09:29:23,150 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-03-20 09:29:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:23,151 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-03-20 09:29:23,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-03-20 09:29:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-03-20 09:29:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-20 09:29:23,154 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:23,155 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:23,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-20 09:29:23,362 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,SelfDestructingSolverStorable12 [2022-03-20 09:29:23,362 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-03-20 09:29:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:23,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41052161] [2022-03-20 09:29:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:23,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:23,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:23,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076940480] [2022-03-20 09:29:23,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 09:29:23,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:23,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:23,372 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-03-20 09:29:23,374 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-03-20 09:29:23,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 09:29:23,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:23,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-20 09:29:23,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-03-20 09:29:23,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41052161] [2022-03-20 09:29:23,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076940480] [2022-03-20 09:29:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076940480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:29:23,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 09:29:23,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-03-20 09:29:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073416832] [2022-03-20 09:29:23,991 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:23,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 09:29:23,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 09:29:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-20 09:29:23,992 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 09:29:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:24,121 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-03-20 09:29:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 09:29:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-03-20 09:29:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:24,122 INFO L225 Difference]: With dead ends: 140 [2022-03-20 09:29:24,122 INFO L226 Difference]: Without dead ends: 129 [2022-03-20 09:29:24,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 09:29:24,123 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:24,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-20 09:29:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-03-20 09:29:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-20 09:29:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-03-20 09:29:24,143 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-03-20 09:29:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:24,143 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-03-20 09:29:24,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 09:29:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-03-20 09:29:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-03-20 09:29:24,145 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:24,145 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:24,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-20 09:29:24,359 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,SelfDestructingSolverStorable13 [2022-03-20 09:29:24,360 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:24,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-03-20 09:29:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:24,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981175051] [2022-03-20 09:29:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:24,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:24,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149007151] [2022-03-20 09:29:24,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 09:29:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:24,373 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:29:24,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 09:29:24,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 09:29:24,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:24,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-20 09:29:24,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-03-20 09:29:24,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:25,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981175051] [2022-03-20 09:29:25,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:25,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149007151] [2022-03-20 09:29:25,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149007151] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:29:25,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 09:29:25,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 09:29:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719399591] [2022-03-20 09:29:25,164 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:25,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 09:29:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:25,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 09:29:25,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-20 09:29:25,165 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-03-20 09:29:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:25,368 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-03-20 09:29:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 09:29:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-03-20 09:29:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:25,369 INFO L225 Difference]: With dead ends: 152 [2022-03-20 09:29:25,369 INFO L226 Difference]: Without dead ends: 150 [2022-03-20 09:29:25,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-20 09:29:25,371 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:25,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:29:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-20 09:29:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-03-20 09:29:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-03-20 09:29:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-03-20 09:29:25,391 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-03-20 09:29:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:25,392 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-03-20 09:29:25,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-03-20 09:29:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-03-20 09:29:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-03-20 09:29:25,393 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:25,393 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:25,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 09:29:25,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-20 09:29:25,611 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-03-20 09:29:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:25,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198897194] [2022-03-20 09:29:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:25,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:25,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408358029] [2022-03-20 09:29:25,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 09:29:25,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:25,621 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:29:25,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 09:29:25,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 09:29:25,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:25,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 09:29:25,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-03-20 09:29:25,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-03-20 09:29:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198897194] [2022-03-20 09:29:26,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408358029] [2022-03-20 09:29:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408358029] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:29:26,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:29:26,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-20 09:29:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144765487] [2022-03-20 09:29:26,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:26,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 09:29:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:26,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 09:29:26,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-20 09:29:26,153 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-03-20 09:29:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:26,463 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-03-20 09:29:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-20 09:29:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-03-20 09:29:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:26,466 INFO L225 Difference]: With dead ends: 368 [2022-03-20 09:29:26,466 INFO L226 Difference]: Without dead ends: 353 [2022-03-20 09:29:26,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-03-20 09:29:26,467 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:26,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 355 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 09:29:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-03-20 09:29:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-03-20 09:29:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-20 09:29:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-03-20 09:29:26,509 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-03-20 09:29:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:26,510 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-03-20 09:29:26,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-03-20 09:29:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-03-20 09:29:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-20 09:29:26,511 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:26,512 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:26,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 09:29:26,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-20 09:29:26,735 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-03-20 09:29:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:26,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075460802] [2022-03-20 09:29:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:26,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:26,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301907218] [2022-03-20 09:29:26,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 09:29:26,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:26,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:26,744 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:29:26,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 09:29:27,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 09:29:27,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:27,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-20 09:29:27,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-03-20 09:29:27,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:27,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:27,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075460802] [2022-03-20 09:29:27,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:27,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301907218] [2022-03-20 09:29:27,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301907218] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:29:27,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 09:29:27,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 09:29:27,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38814093] [2022-03-20 09:29:27,791 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:27,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 09:29:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 09:29:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-20 09:29:27,792 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-03-20 09:29:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:27,957 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-03-20 09:29:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 09:29:27,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-03-20 09:29:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:27,960 INFO L225 Difference]: With dead ends: 313 [2022-03-20 09:29:27,960 INFO L226 Difference]: Without dead ends: 302 [2022-03-20 09:29:27,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-20 09:29:27,961 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:27,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 372 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 09:29:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-03-20 09:29:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-03-20 09:29:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-03-20 09:29:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-03-20 09:29:27,995 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-03-20 09:29:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:27,996 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-03-20 09:29:27,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-03-20 09:29:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-03-20 09:29:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-20 09:29:27,997 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:27,997 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:28,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 09:29:28,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:28,203 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-03-20 09:29:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169865870] [2022-03-20 09:29:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:28,221 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:28,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690827211] [2022-03-20 09:29:28,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 09:29:28,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:28,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:28,222 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:29:28,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-20 09:29:28,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 09:29:28,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:28,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 09:29:28,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:29:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-03-20 09:29:28,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:29:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:29:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169865870] [2022-03-20 09:29:30,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:29:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690827211] [2022-03-20 09:29:30,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690827211] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 09:29:30,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 09:29:30,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 09:29:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792355117] [2022-03-20 09:29:30,988 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 09:29:30,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 09:29:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:29:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 09:29:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-03-20 09:29:30,989 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-20 09:29:33,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 09:29:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:29:34,313 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-03-20 09:29:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 09:29:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-03-20 09:29:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:29:34,315 INFO L225 Difference]: With dead ends: 311 [2022-03-20 09:29:34,315 INFO L226 Difference]: Without dead ends: 309 [2022-03-20 09:29:34,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-03-20 09:29:34,316 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-20 09:29:34,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 164 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-03-20 09:29:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-03-20 09:29:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-03-20 09:29:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-20 09:29:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-03-20 09:29:34,358 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-03-20 09:29:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:29:34,358 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-03-20 09:29:34,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-20 09:29:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-03-20 09:29:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-20 09:29:34,360 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:29:34,360 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:29:34,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-20 09:29:34,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-20 09:29:34,567 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:29:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:29:34,567 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-03-20 09:29:34,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:29:34,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394533228] [2022-03-20 09:29:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:29:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:29:34,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:29:34,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673308449] [2022-03-20 09:29:34,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 09:29:34,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:29:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:29:34,575 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:29:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-20 09:29:36,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 09:29:36,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:29:36,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-20 09:29:36,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:30:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-03-20 09:30:54,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:30:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-03-20 09:30:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:30:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394533228] [2022-03-20 09:30:55,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:30:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673308449] [2022-03-20 09:30:55,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673308449] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:30:55,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:30:55,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-03-20 09:30:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135830743] [2022-03-20 09:30:55,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:30:55,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 09:30:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:30:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 09:30:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=241, Unknown=2, NotChecked=0, Total=306 [2022-03-20 09:30:55,910 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-03-20 09:30:57,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 09:30:59,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 09:31:03,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 09:31:14,795 WARN L232 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 09:31:17,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 09:31:19,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 09:31:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:31:19,532 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-03-20 09:31:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 09:31:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-03-20 09:31:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:31:19,533 INFO L225 Difference]: With dead ends: 315 [2022-03-20 09:31:19,534 INFO L226 Difference]: Without dead ends: 294 [2022-03-20 09:31:19,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=141, Invalid=456, Unknown=3, NotChecked=0, Total=600 [2022-03-20 09:31:19,535 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 84 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-03-20 09:31:19,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 173 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 110 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2022-03-20 09:31:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-20 09:31:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-03-20 09:31:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-03-20 09:31:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-03-20 09:31:19,569 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-03-20 09:31:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:31:19,569 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-03-20 09:31:19,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-03-20 09:31:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-03-20 09:31:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-03-20 09:31:19,572 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:31:19,572 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:31:19,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-20 09:31:19,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:31:19,780 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:31:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:31:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-03-20 09:31:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:31:19,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352895655] [2022-03-20 09:31:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:31:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:31:19,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:31:19,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1585600126] [2022-03-20 09:31:19,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 09:31:19,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:31:19,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:31:19,803 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:31:19,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-20 09:31:20,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-03-20 09:31:20,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 09:31:20,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 09:31:20,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 09:31:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-03-20 09:31:20,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 09:31:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-03-20 09:31:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 09:31:21,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352895655] [2022-03-20 09:31:21,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 09:31:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585600126] [2022-03-20 09:31:21,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585600126] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 09:31:21,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 09:31:21,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-03-20 09:31:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457426686] [2022-03-20 09:31:21,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 09:31:21,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 09:31:21,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 09:31:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 09:31:21,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-20 09:31:21,228 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-03-20 09:31:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 09:31:21,915 INFO L93 Difference]: Finished difference Result 584 states and 594 transitions. [2022-03-20 09:31:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-20 09:31:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-03-20 09:31:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 09:31:21,918 INFO L225 Difference]: With dead ends: 584 [2022-03-20 09:31:21,918 INFO L226 Difference]: Without dead ends: 574 [2022-03-20 09:31:21,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-03-20 09:31:21,919 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 151 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 09:31:21,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 398 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 09:31:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-03-20 09:31:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-03-20 09:31:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-03-20 09:31:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2022-03-20 09:31:21,978 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 297 [2022-03-20 09:31:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 09:31:21,979 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2022-03-20 09:31:21,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-03-20 09:31:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-03-20 09:31:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-03-20 09:31:21,987 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 09:31:21,988 INFO L499 BasicCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 09:31:21,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-20 09:31:22,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:31:22,194 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 09:31:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 09:31:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1448321483, now seen corresponding path program 4 times [2022-03-20 09:31:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 09:31:22,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954624371] [2022-03-20 09:31:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 09:31:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 09:31:22,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 09:31:22,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37808538] [2022-03-20 09:31:22,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 09:31:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:31:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 09:31:22,210 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 09:31:22,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-20 09:31:22,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 09:31:22,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-20 09:31:22,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 09:31:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 09:31:23,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 09:31:23,089 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 09:31:23,090 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 09:31:23,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-20 09:31:23,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 09:31:23,294 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-03-20 09:31:23,298 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 09:31:23,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 09:31:23 BasicIcfg [2022-03-20 09:31:23,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 09:31:23,433 INFO L158 Benchmark]: Toolchain (without parser) took 132426.00ms. Allocated memory was 175.1MB in the beginning and 253.8MB in the end (delta: 78.6MB). Free memory was 123.3MB in the beginning and 212.3MB in the end (delta: -89.0MB). Peak memory consumption was 121.8MB. Max. memory is 8.0GB. [2022-03-20 09:31:23,434 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 139.6MB in the beginning and 139.6MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 09:31:23,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.99ms. Allocated memory is still 175.1MB. Free memory was 123.1MB in the beginning and 150.2MB in the end (delta: -27.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 09:31:23,437 INFO L158 Benchmark]: Boogie Preprocessor took 39.39ms. Allocated memory is still 175.1MB. Free memory was 150.2MB in the beginning and 148.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 09:31:23,437 INFO L158 Benchmark]: RCFGBuilder took 313.70ms. Allocated memory is still 175.1MB. Free memory was 148.7MB in the beginning and 136.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-20 09:31:23,438 INFO L158 Benchmark]: IcfgTransformer took 36.69ms. Allocated memory is still 175.1MB. Free memory was 136.6MB in the beginning and 135.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 09:31:23,438 INFO L158 Benchmark]: TraceAbstraction took 131796.60ms. Allocated memory was 175.1MB in the beginning and 253.8MB in the end (delta: 78.6MB). Free memory was 134.5MB in the beginning and 212.3MB in the end (delta: -77.8MB). Peak memory consumption was 134.1MB. Max. memory is 8.0GB. [2022-03-20 09:31:23,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 139.6MB in the beginning and 139.6MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.99ms. Allocated memory is still 175.1MB. Free memory was 123.1MB in the beginning and 150.2MB in the end (delta: -27.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.39ms. Allocated memory is still 175.1MB. Free memory was 150.2MB in the beginning and 148.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.70ms. Allocated memory is still 175.1MB. Free memory was 148.7MB in the beginning and 136.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 36.69ms. Allocated memory is still 175.1MB. Free memory was 136.6MB in the beginning and 135.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 131796.60ms. Allocated memory was 175.1MB in the beginning and 253.8MB in the end (delta: 78.6MB). Free memory was 134.5MB in the beginning and 212.3MB in the end (delta: -77.8MB). Peak memory consumption was 134.1MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=26, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 131.6s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 615 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 4176 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3195 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2306 IncrementalHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 981 mSDtfsCounter, 2306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2766 GetRequests, 2521 SyntacticMatches, 20 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, InterpolantAutomatonStates: 196, 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, 20 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 89.5s InterpolantComputationTime, 2202 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2526 ConstructedInterpolants, 0 QuantifiedInterpolants, 10620 SizeOfPredicates, 62 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 15720/22306 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-03-20 09:31:23,460 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...