/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/egcd2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 07:37:03,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 07:37:03,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 07:37:04,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 07:37:04,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 07:37:04,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 07:37:04,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 07:37:04,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 07:37:04,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 07:37:04,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 07:37:04,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 07:37:04,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 07:37:04,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 07:37:04,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 07:37:04,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 07:37:04,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 07:37:04,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 07:37:04,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 07:37:04,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 07:37:04,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 07:37:04,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 07:37:04,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 07:37:04,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 07:37:04,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 07:37:04,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 07:37:04,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 07:37:04,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 07:37:04,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 07:37:04,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 07:37:04,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 07:37:04,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 07:37:04,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 07:37:04,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 07:37:04,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 07:37:04,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 07:37:04,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 07:37:04,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 07:37:04,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 07:37:04,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 07:37:04,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 07:37:04,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 07:37:04,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 07:37:04,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 07:37:04,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 07:37:04,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 07:37:04,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 07:37:04,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 07:37:04,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 07:37:04,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 07:37:04,071 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 07:37:04,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 07:37:04,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 07:37:04,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 07:37:04,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 07:37:04,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 07:37:04,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 07:37:04,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 07:37:04,074 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 07:37:04,074 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 07:37:04,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 07:37:04,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 07:37:04,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 07:37:04,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 07:37:04,278 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 07:37:04,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-04-05 07:37:04,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6da83851/280dd253aad94ebb8928209b5e72f65a/FLAGedbb020fe [2022-04-05 07:37:04,684 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 07:37:04,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-04-05 07:37:04,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6da83851/280dd253aad94ebb8928209b5e72f65a/FLAGedbb020fe [2022-04-05 07:37:05,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6da83851/280dd253aad94ebb8928209b5e72f65a [2022-04-05 07:37:05,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 07:37:05,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 07:37:05,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 07:37:05,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 07:37:05,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 07:37:05,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762024d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05, skipping insertion in model container [2022-04-05 07:37:05,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 07:37:05,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 07:37:05,275 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/egcd2-ll_unwindbound50.c[490,503] [2022-04-05 07:37:05,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 07:37:05,300 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 07:37:05,308 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/egcd2-ll_unwindbound50.c[490,503] [2022-04-05 07:37:05,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 07:37:05,324 INFO L208 MainTranslator]: Completed translation [2022-04-05 07:37:05,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05 WrapperNode [2022-04-05 07:37:05,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 07:37:05,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 07:37:05,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 07:37:05,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 07:37:05,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 07:37:05,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 07:37:05,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 07:37:05,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 07:37:05,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 07:37:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:05,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 07:37:05,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 07:37:05,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 07:37:05,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 07:37:05,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 07:37:05,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 07:37:05,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 07:37:05,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 07:37:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 07:37:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 07:37:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 07:37:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 07:37:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 07:37:05,484 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 07:37:05,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 07:37:05,581 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 07:37:05,586 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 07:37:05,586 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-05 07:37:05,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:37:05 BoogieIcfgContainer [2022-04-05 07:37:05,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 07:37:05,588 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 07:37:05,588 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 07:37:05,589 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 07:37:05,591 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:37:05" (1/1) ... [2022-04-05 07:37:05,593 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 07:37:05,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 07:37:05 BasicIcfg [2022-04-05 07:37:05,606 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 07:37:05,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 07:37:05,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 07:37:05,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 07:37:05,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 07:37:05" (1/4) ... [2022-04-05 07:37:05,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf7bb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:37:05, skipping insertion in model container [2022-04-05 07:37:05,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:37:05" (2/4) ... [2022-04-05 07:37:05,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf7bb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:37:05, skipping insertion in model container [2022-04-05 07:37:05,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:37:05" (3/4) ... [2022-04-05 07:37:05,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf7bb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 07:37:05, skipping insertion in model container [2022-04-05 07:37:05,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 07:37:05" (4/4) ... [2022-04-05 07:37:05,612 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound50.cqvasr [2022-04-05 07:37:05,616 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 07:37:05,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 07:37:05,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 07:37:05,657 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 07:37:05,657 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 07:37:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-05 07:37:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-05 07:37:05,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:05,704 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:05,704 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-04-05 07:37:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:05,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945303760] [2022-04-05 07:37:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:05,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:05,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267974458] [2022-04-05 07:37:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:05,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:05,787 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:05,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 07:37:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:05,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-05 07:37:05,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-05 07:37:05,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 07:37:05,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:05,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945303760] [2022-04-05 07:37:05,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267974458] [2022-04-05 07:37:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267974458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 07:37:05,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 07:37:05,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-05 07:37:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460412820] [2022-04-05 07:37:05,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:05,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-05 07:37:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-05 07:37:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-05 07:37:05,975 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 07:37:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:05,993 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-05 07:37:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-05 07:37:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-05 07:37:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:06,002 INFO L225 Difference]: With dead ends: 71 [2022-04-05 07:37:06,002 INFO L226 Difference]: Without dead ends: 34 [2022-04-05 07:37:06,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-05 07:37:06,007 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:06,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 07:37:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-05 07:37:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-05 07:37:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 07:37:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-05 07:37:06,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-05 07:37:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:06,034 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-05 07:37:06,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 07:37:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-05 07:37:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-05 07:37:06,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:06,035 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:06,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-05 07:37:06,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-05 07:37:06,236 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-04-05 07:37:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:06,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314569374] [2022-04-05 07:37:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:06,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:06,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092490266] [2022-04-05 07:37:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:06,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:06,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:06,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:06,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 07:37:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:06,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 07:37:06,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-05 07:37:06,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 07:37:06,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:06,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314569374] [2022-04-05 07:37:06,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:06,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092490266] [2022-04-05 07:37:06,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092490266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 07:37:06,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 07:37:06,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 07:37:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378110285] [2022-04-05 07:37:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:06,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 07:37:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 07:37:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 07:37:06,419 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 07:37:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:06,439 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-05 07:37:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 07:37:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-05 07:37:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:06,440 INFO L225 Difference]: With dead ends: 44 [2022-04-05 07:37:06,441 INFO L226 Difference]: Without dead ends: 36 [2022-04-05 07:37:06,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 07:37:06,442 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:06,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 07:37:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-05 07:37:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-05 07:37:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 07:37:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-05 07:37:06,449 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-05 07:37:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:06,449 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-05 07:37:06,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 07:37:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-05 07:37:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-05 07:37:06,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:06,450 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:06,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 07:37:06,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-05 07:37:06,662 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-04-05 07:37:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:06,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207330367] [2022-04-05 07:37:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:06,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:06,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860158829] [2022-04-05 07:37:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:06,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:06,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 07:37:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:06,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 07:37:06,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-05 07:37:06,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-05 07:37:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:06,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207330367] [2022-04-05 07:37:06,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860158829] [2022-04-05 07:37:06,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860158829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:06,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:06,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-05 07:37:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471034281] [2022-04-05 07:37:06,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:06,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 07:37:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 07:37:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 07:37:06,908 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 07:37:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:06,999 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-05 07:37:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 07:37:06,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-05 07:37:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:07,000 INFO L225 Difference]: With dead ends: 53 [2022-04-05 07:37:07,000 INFO L226 Difference]: Without dead ends: 45 [2022-04-05 07:37:07,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-05 07:37:07,001 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:07,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 07:37:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-05 07:37:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-05 07:37:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 07:37:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-05 07:37:07,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-05 07:37:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:07,008 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-05 07:37:07,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 07:37:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-05 07:37:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-05 07:37:07,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:07,009 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:07,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-05 07:37:07,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:07,241 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-04-05 07:37:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:07,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122324895] [2022-04-05 07:37:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:07,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:07,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923997702] [2022-04-05 07:37:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:07,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:07,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:07,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:07,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 07:37:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:07,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-05 07:37:07,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-05 07:37:07,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-05 07:37:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:07,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122324895] [2022-04-05 07:37:07,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:07,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923997702] [2022-04-05 07:37:07,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923997702] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:07,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:07,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-05 07:37:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482679149] [2022-04-05 07:37:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:07,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 07:37:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 07:37:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-05 07:37:07,499 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 07:37:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:07,532 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-05 07:37:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 07:37:07,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-05 07:37:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:07,541 INFO L225 Difference]: With dead ends: 43 [2022-04-05 07:37:07,541 INFO L226 Difference]: Without dead ends: 41 [2022-04-05 07:37:07,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-05 07:37:07,544 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:07,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 07:37:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-05 07:37:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-05 07:37:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 07:37:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-05 07:37:07,551 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-05 07:37:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:07,551 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-05 07:37:07,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 07:37:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-05 07:37:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-05 07:37:07,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:07,552 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:07,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-05 07:37:07,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:07,759 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-04-05 07:37:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:07,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182462285] [2022-04-05 07:37:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:07,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:07,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343110528] [2022-04-05 07:37:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:07,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:07,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:07,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 07:37:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:07,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 07:37:07,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-05 07:37:07,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 07:37:07,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:07,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182462285] [2022-04-05 07:37:07,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:07,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343110528] [2022-04-05 07:37:07,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343110528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 07:37:07,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 07:37:07,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 07:37:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245803702] [2022-04-05 07:37:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:07,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 07:37:07,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:07,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 07:37:07,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-05 07:37:07,887 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 07:37:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:07,918 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-05 07:37:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 07:37:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-05 07:37:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:07,921 INFO L225 Difference]: With dead ends: 66 [2022-04-05 07:37:07,921 INFO L226 Difference]: Without dead ends: 43 [2022-04-05 07:37:07,921 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-05 07:37:07,922 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:07,922 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 07:37:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-05 07:37:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-05 07:37:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-05 07:37:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-05 07:37:07,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-05 07:37:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:07,930 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-05 07:37:07,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 07:37:07,930 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-05 07:37:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-05 07:37:07,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:07,930 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:07,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:08,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:08,149 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash 578094295, now seen corresponding path program 1 times [2022-04-05 07:37:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:08,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918012917] [2022-04-05 07:37:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:08,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216076086] [2022-04-05 07:37:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:08,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:08,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:08,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 07:37:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:08,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-05 07:37:08,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-05 07:37:08,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-05 07:37:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:08,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918012917] [2022-04-05 07:37:08,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:08,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216076086] [2022-04-05 07:37:08,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216076086] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:08,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:08,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-05 07:37:08,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997920557] [2022-04-05 07:37:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:08,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 07:37:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 07:37:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-05 07:37:08,428 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-05 07:37:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:08,460 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-05 07:37:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 07:37:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-05 07:37:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:08,462 INFO L225 Difference]: With dead ends: 57 [2022-04-05 07:37:08,462 INFO L226 Difference]: Without dead ends: 55 [2022-04-05 07:37:08,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-05 07:37:08,462 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:08,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 07:37:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-05 07:37:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-05 07:37:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-05 07:37:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-05 07:37:08,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-05 07:37:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:08,469 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-05 07:37:08,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-05 07:37:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-05 07:37:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-05 07:37:08,469 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:08,470 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:08,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:08,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:08,686 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1581112078, now seen corresponding path program 1 times [2022-04-05 07:37:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:08,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729152810] [2022-04-05 07:37:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:08,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987843704] [2022-04-05 07:37:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:08,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:08,709 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:08,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-05 07:37:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:08,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-05 07:37:08,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-05 07:37:08,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-05 07:37:08,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:08,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729152810] [2022-04-05 07:37:08,968 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:08,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987843704] [2022-04-05 07:37:08,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987843704] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:08,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:08,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-05 07:37:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276054132] [2022-04-05 07:37:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:08,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 07:37:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 07:37:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-05 07:37:08,971 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-05 07:37:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:09,022 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-05 07:37:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 07:37:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-05 07:37:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:09,026 INFO L225 Difference]: With dead ends: 61 [2022-04-05 07:37:09,026 INFO L226 Difference]: Without dead ends: 59 [2022-04-05 07:37:09,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-05 07:37:09,027 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:09,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 07:37:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-05 07:37:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-05 07:37:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-05 07:37:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-05 07:37:09,042 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-05 07:37:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:09,043 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-05 07:37:09,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-05 07:37:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-05 07:37:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 07:37:09,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:09,044 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:09,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:09,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:09,245 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1942645143, now seen corresponding path program 1 times [2022-04-05 07:37:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:09,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769375465] [2022-04-05 07:37:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:09,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:09,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738172790] [2022-04-05 07:37:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:09,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:09,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:09,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:09,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-05 07:37:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:09,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-05 07:37:09,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-05 07:37:09,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:09,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769375465] [2022-04-05 07:37:09,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:09,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738172790] [2022-04-05 07:37:09,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738172790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:09,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:09,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-05 07:37:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194735494] [2022-04-05 07:37:09,621 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:09,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 07:37:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:09,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 07:37:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-05 07:37:09,621 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-05 07:37:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:09,797 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-05 07:37:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 07:37:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-05 07:37:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:09,798 INFO L225 Difference]: With dead ends: 65 [2022-04-05 07:37:09,798 INFO L226 Difference]: Without dead ends: 63 [2022-04-05 07:37:09,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-05 07:37:09,799 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:09,799 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 140 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 07:37:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-05 07:37:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-05 07:37:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-05 07:37:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-05 07:37:09,804 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-05 07:37:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:09,804 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-05 07:37:09,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-05 07:37:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-05 07:37:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-05 07:37:09,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:09,805 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:09,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:10,015 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,SelfDestructingSolverStorable7 [2022-04-05 07:37:10,016 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1573186588, now seen corresponding path program 1 times [2022-04-05 07:37:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:10,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981953020] [2022-04-05 07:37:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:10,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:10,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501256578] [2022-04-05 07:37:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:10,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:10,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:10,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:10,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-05 07:37:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:10,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 07:37:10,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-05 07:37:10,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-05 07:37:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:10,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981953020] [2022-04-05 07:37:10,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501256578] [2022-04-05 07:37:10,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501256578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:10,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:10,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-05 07:37:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638937334] [2022-04-05 07:37:10,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:10,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 07:37:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:10,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 07:37:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-05 07:37:10,247 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 07:37:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:10,390 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2022-04-05 07:37:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 07:37:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-05 07:37:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:10,394 INFO L225 Difference]: With dead ends: 215 [2022-04-05 07:37:10,394 INFO L226 Difference]: Without dead ends: 207 [2022-04-05 07:37:10,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-05 07:37:10,396 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 139 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:10,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 201 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 07:37:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-05 07:37:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-04-05 07:37:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-05 07:37:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-04-05 07:37:10,421 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-04-05 07:37:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:10,421 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-04-05 07:37:10,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 07:37:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-04-05 07:37:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-05 07:37:10,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:10,422 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:10,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:10,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:10,631 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1491020248, now seen corresponding path program 1 times [2022-04-05 07:37:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:10,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603601148] [2022-04-05 07:37:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:10,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:10,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620787476] [2022-04-05 07:37:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:10,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:10,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:10,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:10,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-05 07:37:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:10,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 07:37:10,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-05 07:37:10,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-05 07:37:10,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:10,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603601148] [2022-04-05 07:37:10,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:10,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620787476] [2022-04-05 07:37:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620787476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:10,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-05 07:37:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654994484] [2022-04-05 07:37:10,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:10,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 07:37:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 07:37:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-05 07:37:10,929 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-05 07:37:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:11,082 INFO L93 Difference]: Finished difference Result 283 states and 368 transitions. [2022-04-05 07:37:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 07:37:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-05 07:37:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:11,084 INFO L225 Difference]: With dead ends: 283 [2022-04-05 07:37:11,084 INFO L226 Difference]: Without dead ends: 263 [2022-04-05 07:37:11,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-05 07:37:11,085 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:11,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 262 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 07:37:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-05 07:37:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-04-05 07:37:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-05 07:37:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-04-05 07:37:11,102 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-04-05 07:37:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:11,102 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-04-05 07:37:11,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-05 07:37:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-04-05 07:37:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-05 07:37:11,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:11,103 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:11,132 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-04-05 07:37:11,319 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,SelfDestructingSolverStorable9 [2022-04-05 07:37:11,319 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 317217743, now seen corresponding path program 1 times [2022-04-05 07:37:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:11,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677254869] [2022-04-05 07:37:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:11,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:11,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814759521] [2022-04-05 07:37:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:11,328 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:11,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-05 07:37:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:11,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-05 07:37:11,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-05 07:37:11,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-05 07:37:11,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:11,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677254869] [2022-04-05 07:37:11,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:11,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814759521] [2022-04-05 07:37:11,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814759521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:11,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:11,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-05 07:37:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110414762] [2022-04-05 07:37:11,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:11,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 07:37:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:11,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 07:37:11,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-05 07:37:11,560 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 07:37:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:11,670 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2022-04-05 07:37:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 07:37:11,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-05 07:37:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:11,673 INFO L225 Difference]: With dead ends: 348 [2022-04-05 07:37:11,673 INFO L226 Difference]: Without dead ends: 252 [2022-04-05 07:37:11,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-05 07:37:11,675 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 103 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:11,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 193 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 07:37:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-05 07:37:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-04-05 07:37:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-05 07:37:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-04-05 07:37:11,688 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-04-05 07:37:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:11,689 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-04-05 07:37:11,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-05 07:37:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-04-05 07:37:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-05 07:37:11,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:11,690 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:11,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:11,897 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,SelfDestructingSolverStorable10 [2022-04-05 07:37:11,897 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 918639692, now seen corresponding path program 1 times [2022-04-05 07:37:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:11,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510276695] [2022-04-05 07:37:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:11,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:11,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710251123] [2022-04-05 07:37:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:11,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:11,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:11,909 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-04-05 07:37:11,910 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-04-05 07:37:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:11,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-05 07:37:11,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-05 07:37:12,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-05 07:37:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510276695] [2022-04-05 07:37:12,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710251123] [2022-04-05 07:37:12,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710251123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:12,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:12,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-05 07:37:12,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26691759] [2022-04-05 07:37:12,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:12,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 07:37:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 07:37:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-05 07:37:12,316 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-05 07:37:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:12,638 INFO L93 Difference]: Finished difference Result 334 states and 433 transitions. [2022-04-05 07:37:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 07:37:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-05 07:37:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:12,641 INFO L225 Difference]: With dead ends: 334 [2022-04-05 07:37:12,641 INFO L226 Difference]: Without dead ends: 328 [2022-04-05 07:37:12,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-05 07:37:12,642 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:12,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 294 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 07:37:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-05 07:37:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-04-05 07:37:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-05 07:37:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-04-05 07:37:12,659 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-04-05 07:37:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:12,660 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-04-05 07:37:12,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-05 07:37:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-04-05 07:37:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-05 07:37:12,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:12,660 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:12,677 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-04-05 07:37:12,877 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,SelfDestructingSolverStorable11 [2022-04-05 07:37:12,877 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -210356579, now seen corresponding path program 2 times [2022-04-05 07:37:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:12,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919926806] [2022-04-05 07:37:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:12,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:12,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334566985] [2022-04-05 07:37:12,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 07:37:12,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:12,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:12,893 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-04-05 07:37:12,894 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-04-05 07:37:12,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 07:37:12,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:37:12,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-05 07:37:12,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-05 07:37:13,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-05 07:37:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:13,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919926806] [2022-04-05 07:37:13,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:13,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334566985] [2022-04-05 07:37:13,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334566985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:13,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:13,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-05 07:37:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362645036] [2022-04-05 07:37:13,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:13,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 07:37:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 07:37:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-05 07:37:13,561 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-05 07:37:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:14,491 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-04-05 07:37:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 07:37:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-05 07:37:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:14,493 INFO L225 Difference]: With dead ends: 319 [2022-04-05 07:37:14,493 INFO L226 Difference]: Without dead ends: 316 [2022-04-05 07:37:14,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-05 07:37:14,494 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:14,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 07:37:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-05 07:37:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-04-05 07:37:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-05 07:37:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-04-05 07:37:14,514 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-04-05 07:37:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:14,514 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-04-05 07:37:14,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-05 07:37:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-04-05 07:37:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-05 07:37:14,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:14,515 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-04-05 07:37:14,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-04-05 07:37:14,719 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,SelfDestructingSolverStorable12 [2022-04-05 07:37:14,719 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 952478412, now seen corresponding path program 3 times [2022-04-05 07:37:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724882946] [2022-04-05 07:37:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:14,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:14,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918112394] [2022-04-05 07:37:14,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 07:37:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:14,735 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-04-05 07:37:14,736 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-04-05 07:37:14,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-05 07:37:14,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:37:14,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-05 07:37:14,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-05 07:37:15,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:15,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724882946] [2022-04-05 07:37:15,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:15,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918112394] [2022-04-05 07:37:15,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918112394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:15,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:15,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-05 07:37:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492828422] [2022-04-05 07:37:15,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:15,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 07:37:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 07:37:15,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-05 07:37:15,231 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-05 07:37:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:15,428 INFO L93 Difference]: Finished difference Result 337 states and 411 transitions. [2022-04-05 07:37:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 07:37:15,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-05 07:37:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:15,430 INFO L225 Difference]: With dead ends: 337 [2022-04-05 07:37:15,430 INFO L226 Difference]: Without dead ends: 333 [2022-04-05 07:37:15,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-05 07:37:15,431 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:15,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 07:37:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-05 07:37:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-04-05 07:37:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-05 07:37:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-04-05 07:37:15,452 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-04-05 07:37:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:15,452 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-04-05 07:37:15,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-05 07:37:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-04-05 07:37:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-05 07:37:15,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:15,453 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:15,472 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-04-05 07:37:15,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:15,672 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:15,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:15,673 INFO L85 PathProgramCache]: Analyzing trace with hash 900405455, now seen corresponding path program 1 times [2022-04-05 07:37:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:15,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766468722] [2022-04-05 07:37:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:15,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:15,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128887662] [2022-04-05 07:37:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:15,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:15,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:15,682 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-04-05 07:37:15,690 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-04-05 07:37:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:15,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-05 07:37:15,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-05 07:37:16,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-05 07:37:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:16,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766468722] [2022-04-05 07:37:16,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:16,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128887662] [2022-04-05 07:37:16,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128887662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:16,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:16,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-05 07:37:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312690743] [2022-04-05 07:37:16,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:16,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-05 07:37:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-05 07:37:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-05 07:37:16,602 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-05 07:37:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:19,301 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2022-04-05 07:37:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-05 07:37:19,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-05 07:37:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:19,303 INFO L225 Difference]: With dead ends: 392 [2022-04-05 07:37:19,303 INFO L226 Difference]: Without dead ends: 377 [2022-04-05 07:37:19,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-05 07:37:19,304 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 80 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:19,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 377 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-05 07:37:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-05 07:37:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-04-05 07:37:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-05 07:37:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-04-05 07:37:19,335 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-04-05 07:37:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:19,335 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-04-05 07:37:19,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-05 07:37:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-04-05 07:37:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-05 07:37:19,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:19,336 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:19,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-05 07:37:19,545 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,SelfDestructingSolverStorable14 [2022-04-05 07:37:19,546 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 653404933, now seen corresponding path program 1 times [2022-04-05 07:37:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:19,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401378729] [2022-04-05 07:37:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:19,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:19,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065879223] [2022-04-05 07:37:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:19,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:19,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:19,568 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-04-05 07:37:19,569 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-04-05 07:37:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:19,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-05 07:37:19,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-05 07:37:20,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:20,599 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 07:37:21,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:21,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401378729] [2022-04-05 07:37:21,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:21,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065879223] [2022-04-05 07:37:21,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065879223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:21,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:21,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-05 07:37:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707787867] [2022-04-05 07:37:21,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:21,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 07:37:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 07:37:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-05 07:37:21,127 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-05 07:37:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:21,718 INFO L93 Difference]: Finished difference Result 377 states and 468 transitions. [2022-04-05 07:37:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 07:37:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-05 07:37:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:21,720 INFO L225 Difference]: With dead ends: 377 [2022-04-05 07:37:21,720 INFO L226 Difference]: Without dead ends: 375 [2022-04-05 07:37:21,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-05 07:37:21,721 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:21,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 281 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 07:37:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-05 07:37:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-04-05 07:37:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-05 07:37:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-04-05 07:37:21,755 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-04-05 07:37:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:21,755 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-04-05 07:37:21,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-05 07:37:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-04-05 07:37:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-05 07:37:21,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:21,758 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:21,777 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-04-05 07:37:21,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-05 07:37:21,967 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash 487608439, now seen corresponding path program 4 times [2022-04-05 07:37:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:21,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552895422] [2022-04-05 07:37:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:21,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:21,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776742025] [2022-04-05 07:37:21,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 07:37:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:21,975 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-04-05 07:37:21,976 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-04-05 07:37:22,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 07:37:22,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:37:22,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 07:37:22,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-05 07:37:22,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 07:37:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552895422] [2022-04-05 07:37:22,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776742025] [2022-04-05 07:37:22,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776742025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 07:37:22,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 07:37:22,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 07:37:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689046351] [2022-04-05 07:37:22,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 07:37:22,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 07:37:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 07:37:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 07:37:22,149 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-05 07:37:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:22,249 INFO L93 Difference]: Finished difference Result 535 states and 713 transitions. [2022-04-05 07:37:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 07:37:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-05 07:37:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:22,251 INFO L225 Difference]: With dead ends: 535 [2022-04-05 07:37:22,251 INFO L226 Difference]: Without dead ends: 417 [2022-04-05 07:37:22,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 07:37:22,252 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:22,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 07:37:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-05 07:37:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-04-05 07:37:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-05 07:37:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-04-05 07:37:22,302 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-04-05 07:37:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:22,302 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-04-05 07:37:22,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-05 07:37:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-04-05 07:37:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-05 07:37:22,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:22,304 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:22,323 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-04-05 07:37:22,523 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-05 07:37:22,524 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 791718745, now seen corresponding path program 1 times [2022-04-05 07:37:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:22,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019858411] [2022-04-05 07:37:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:22,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474038570] [2022-04-05 07:37:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:22,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:22,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:22,534 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-04-05 07:37:22,567 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-04-05 07:37:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:37:22,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-05 07:37:22,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-05 07:37:22,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-05 07:37:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019858411] [2022-04-05 07:37:22,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474038570] [2022-04-05 07:37:22,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474038570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:37:22,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:37:22,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-05 07:37:22,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646347836] [2022-04-05 07:37:22,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:22,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-05 07:37:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-05 07:37:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-05 07:37:22,995 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-05 07:37:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:23,463 INFO L93 Difference]: Finished difference Result 1393 states and 1817 transitions. [2022-04-05 07:37:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-05 07:37:23,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-05 07:37:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:23,467 INFO L225 Difference]: With dead ends: 1393 [2022-04-05 07:37:23,468 INFO L226 Difference]: Without dead ends: 1260 [2022-04-05 07:37:23,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-04-05 07:37:23,469 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 313 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:23,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 386 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 07:37:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-05 07:37:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-04-05 07:37:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-05 07:37:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-04-05 07:37:23,622 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-04-05 07:37:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:23,622 INFO L478 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-04-05 07:37:23,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-05 07:37:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-04-05 07:37:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-05 07:37:23,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:23,623 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:23,643 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-04-05 07:37:23,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-05 07:37:23,843 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash -351372628, now seen corresponding path program 2 times [2022-04-05 07:37:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:23,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421785205] [2022-04-05 07:37:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:23,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977047049] [2022-04-05 07:37:23,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 07:37:23,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:23,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:23,854 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:23,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-05 07:37:23,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 07:37:23,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:37:23,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-05 07:37:23,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:27,320 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 07:37:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-05 07:37:29,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:37:44,848 WARN L232 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 07:37:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:37:52,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421785205] [2022-04-05 07:37:52,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:37:52,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977047049] [2022-04-05 07:37:52,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977047049] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 07:37:52,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 07:37:52,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-05 07:37:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481114060] [2022-04-05 07:37:52,500 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 07:37:52,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-05 07:37:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:37:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-05 07:37:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2022-04-05 07:37:52,501 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-05 07:37:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:37:54,690 INFO L93 Difference]: Finished difference Result 1331 states and 1650 transitions. [2022-04-05 07:37:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 07:37:54,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-05 07:37:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:37:54,695 INFO L225 Difference]: With dead ends: 1331 [2022-04-05 07:37:54,695 INFO L226 Difference]: Without dead ends: 1329 [2022-04-05 07:37:54,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=187, Invalid=742, Unknown=1, NotChecked=0, Total=930 [2022-04-05 07:37:54,696 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-05 07:37:54,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 333 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-05 07:37:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-04-05 07:37:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-04-05 07:37:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-05 07:37:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1632 transitions. [2022-04-05 07:37:54,828 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1632 transitions. Word has length 124 [2022-04-05 07:37:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:37:54,828 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1632 transitions. [2022-04-05 07:37:54,828 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-05 07:37:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1632 transitions. [2022-04-05 07:37:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-05 07:37:54,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:37:54,829 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:37:54,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-05 07:37:55,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:55,043 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:37:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:37:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1703433466, now seen corresponding path program 3 times [2022-04-05 07:37:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:37:55,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585060372] [2022-04-05 07:37:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:37:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:37:55,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:37:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512583332] [2022-04-05 07:37:55,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 07:37:55,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:37:55,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:37:55,054 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:37:55,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-05 07:37:55,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-05 07:37:55,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:37:55,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-05 07:37:55,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:37:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-05 07:37:56,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:38:28,397 WARN L232 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 24 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-05 07:38:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 56 refuted. 1 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-05 07:38:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:38:49,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585060372] [2022-04-05 07:38:49,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:38:49,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512583332] [2022-04-05 07:38:49,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512583332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:38:49,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:38:49,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-05 07:38:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109408803] [2022-04-05 07:38:49,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:38:49,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-05 07:38:49,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:38:49,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-05 07:38:49,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=354, Unknown=4, NotChecked=0, Total=462 [2022-04-05 07:38:49,968 INFO L87 Difference]: Start difference. First operand 1321 states and 1632 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-05 07:38:52,107 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-04-05 07:38:54,164 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-04-05 07:38:56,305 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-04-05 07:38:59,266 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-04-05 07:39:04,156 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-04-05 07:39:06,225 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-04-05 07:39:08,228 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-04-05 07:40:25,088 WARN L232 SmtUtils]: Spent 1.25m on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 07:40:53,265 WARN L232 SmtUtils]: Spent 15.71s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 07:40:55,269 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-04-05 07:40:57,275 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-04-05 07:40:59,281 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-04-05 07:41:01,317 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-04-05 07:41:03,874 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-04-05 07:41:06,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-04-05 07:41:08,649 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-04-05 07:41:15,965 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-04-05 07:42:12,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 56.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:42:16,963 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-04-05 07:42:21,592 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-04-05 07:42:23,634 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-04-05 07:42:25,703 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-04-05 07:42:29,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:42:31,197 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-04-05 07:42:33,374 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-04-05 07:42:35,560 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-04-05 07:42:36,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:42:38,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:42:57,516 WARN L232 SmtUtils]: Spent 10.49s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 07:42:59,529 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-04-05 07:43:01,718 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-04-05 07:43:05,893 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-04-05 07:43:08,847 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-04-05 07:43:10,854 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-04-05 07:43:12,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:43:14,894 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-04-05 07:43:17,913 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-04-05 07:43:27,698 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-04-05 07:43:29,948 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-04-05 07:43:32,028 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-04-05 07:43:34,122 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-04-05 07:43:36,203 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-04-05 07:43:38,287 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-04-05 07:43:40,290 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-04-05 07:43:42,351 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-04-05 07:43:44,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:43:48,479 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-04-05 07:44:01,903 WARN L232 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 54 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 07:44:04,660 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-04-05 07:44:06,667 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-04-05 07:44:08,673 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-04-05 07:44:11,465 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-04-05 07:44:25,086 WARN L232 SmtUtils]: Spent 11.12s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 07:44:27,120 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-04-05 07:44:28,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-05 07:44:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:44:29,378 INFO L93 Difference]: Finished difference Result 1675 states and 2127 transitions. [2022-04-05 07:44:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-05 07:44:29,378 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-04-05 07:44:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:44:29,385 INFO L225 Difference]: With dead ends: 1675 [2022-04-05 07:44:29,385 INFO L226 Difference]: Without dead ends: 1659 [2022-04-05 07:44:29,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 185.0s TimeCoverageRelationStatistics Valid=388, Invalid=1074, Unknown=20, NotChecked=0, Total=1482 [2022-04-05 07:44:29,386 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 156 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 192 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 167.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.7s IncrementalHoareTripleChecker+Time [2022-04-05 07:44:29,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 484 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1010 Invalid, 47 Unknown, 0 Unchecked, 167.7s Time] [2022-04-05 07:44:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-04-05 07:44:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1538. [2022-04-05 07:44:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 989 states have (on average 1.1718907987866531) internal successors, (1159), 998 states have internal predecessors, (1159), 393 states have call successors, (393), 157 states have call predecessors, (393), 155 states have return successors, (390), 382 states have call predecessors, (390), 390 states have call successors, (390) [2022-04-05 07:44:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1942 transitions. [2022-04-05 07:44:29,757 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1942 transitions. Word has length 128 [2022-04-05 07:44:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:44:29,757 INFO L478 AbstractCegarLoop]: Abstraction has 1538 states and 1942 transitions. [2022-04-05 07:44:29,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-05 07:44:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1942 transitions. [2022-04-05 07:44:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-05 07:44:29,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:44:29,759 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:44:29,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-05 07:44:29,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:29,975 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:44:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:44:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1569660177, now seen corresponding path program 1 times [2022-04-05 07:44:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:44:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99806615] [2022-04-05 07:44:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:44:29,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:44:29,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639709887] [2022-04-05 07:44:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:29,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:44:30,000 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:44:30,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-05 07:44:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:44:30,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-05 07:44:30,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:44:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-05 07:44:30,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:44:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-05 07:44:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:44:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99806615] [2022-04-05 07:44:30,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:44:30,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639709887] [2022-04-05 07:44:30,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639709887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:44:30,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:44:30,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-05 07:44:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869616402] [2022-04-05 07:44:30,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:44:30,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-05 07:44:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:44:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-05 07:44:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-05 07:44:30,538 INFO L87 Difference]: Start difference. First operand 1538 states and 1942 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-05 07:44:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:44:31,192 INFO L93 Difference]: Finished difference Result 1595 states and 1996 transitions. [2022-04-05 07:44:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-05 07:44:31,193 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-04-05 07:44:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:44:31,197 INFO L225 Difference]: With dead ends: 1595 [2022-04-05 07:44:31,197 INFO L226 Difference]: Without dead ends: 1585 [2022-04-05 07:44:31,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-04-05 07:44:31,198 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 292 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 07:44:31,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 366 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 07:44:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-04-05 07:44:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1553. [2022-04-05 07:44:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1004 states have (on average 1.1484063745019921) internal successors, (1153), 1013 states have internal predecessors, (1153), 393 states have call successors, (393), 157 states have call predecessors, (393), 155 states have return successors, (390), 382 states have call predecessors, (390), 390 states have call successors, (390) [2022-04-05 07:44:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1936 transitions. [2022-04-05 07:44:31,480 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1936 transitions. Word has length 133 [2022-04-05 07:44:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:44:31,481 INFO L478 AbstractCegarLoop]: Abstraction has 1553 states and 1936 transitions. [2022-04-05 07:44:31,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-04-05 07:44:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1936 transitions. [2022-04-05 07:44:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-05 07:44:31,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:44:31,483 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:44:31,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-05 07:44:31,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:31,699 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:44:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:44:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1381701507, now seen corresponding path program 2 times [2022-04-05 07:44:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:44:31,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140321426] [2022-04-05 07:44:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:44:31,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:44:31,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83479074] [2022-04-05 07:44:31,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 07:44:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:44:31,707 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:44:31,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-05 07:44:31,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 07:44:31,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:44:31,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-05 07:44:31,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:44:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-04-05 07:44:33,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:44:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-05 07:44:34,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:44:34,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140321426] [2022-04-05 07:44:34,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:44:34,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83479074] [2022-04-05 07:44:34,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83479074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:44:34,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:44:34,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-05 07:44:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167853193] [2022-04-05 07:44:34,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:44:34,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 07:44:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:44:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 07:44:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-04-05 07:44:34,687 INFO L87 Difference]: Start difference. First operand 1553 states and 1936 transitions. Second operand has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-05 07:44:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:44:41,470 INFO L93 Difference]: Finished difference Result 1681 states and 2084 transitions. [2022-04-05 07:44:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-05 07:44:41,471 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 134 [2022-04-05 07:44:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:44:41,475 INFO L225 Difference]: With dead ends: 1681 [2022-04-05 07:44:41,475 INFO L226 Difference]: Without dead ends: 1670 [2022-04-05 07:44:41,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2022-04-05 07:44:41,476 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 109 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-05 07:44:41,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 475 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-05 07:44:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-04-05 07:44:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1358. [2022-04-05 07:44:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 869 states have (on average 1.1357882623705409) internal successors, (987), 881 states have internal predecessors, (987), 335 states have call successors, (335), 154 states have call predecessors, (335), 153 states have return successors, (333), 322 states have call predecessors, (333), 333 states have call successors, (333) [2022-04-05 07:44:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1655 transitions. [2022-04-05 07:44:41,722 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1655 transitions. Word has length 134 [2022-04-05 07:44:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:44:41,722 INFO L478 AbstractCegarLoop]: Abstraction has 1358 states and 1655 transitions. [2022-04-05 07:44:41,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-05 07:44:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1655 transitions. [2022-04-05 07:44:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-04-05 07:44:41,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:44:41,726 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:44:41,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-05 07:44:41,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:41,942 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:44:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:44:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash -42185316, now seen corresponding path program 2 times [2022-04-05 07:44:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:44:41,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300780223] [2022-04-05 07:44:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:44:41,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:44:41,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070366625] [2022-04-05 07:44:41,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 07:44:41,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:44:41,951 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:44:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-05 07:44:42,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 07:44:42,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:44:42,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-05 07:44:42,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:44:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-05 07:44:42,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:44:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-04-05 07:44:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:44:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300780223] [2022-04-05 07:44:43,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:44:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070366625] [2022-04-05 07:44:43,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070366625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:44:43,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:44:43,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-05 07:44:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549601110] [2022-04-05 07:44:43,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:44:43,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-05 07:44:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:44:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-05 07:44:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-05 07:44:43,094 INFO L87 Difference]: Start difference. First operand 1358 states and 1655 transitions. Second operand has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-05 07:44:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:44:45,416 INFO L93 Difference]: Finished difference Result 5562 states and 7710 transitions. [2022-04-05 07:44:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-05 07:44:45,417 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) Word has length 260 [2022-04-05 07:44:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:44:45,437 INFO L225 Difference]: With dead ends: 5562 [2022-04-05 07:44:45,437 INFO L226 Difference]: Without dead ends: 5553 [2022-04-05 07:44:45,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1384, Invalid=2398, Unknown=0, NotChecked=0, Total=3782 [2022-04-05 07:44:45,440 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 855 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 07:44:45,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 830 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 07:44:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2022-04-05 07:44:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 5446. [2022-04-05 07:44:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5446 states, 3519 states have (on average 1.2145495879511226) internal successors, (4274), 3663 states have internal predecessors, (4274), 1536 states have call successors, (1536), 392 states have call predecessors, (1536), 390 states have return successors, (1520), 1390 states have call predecessors, (1520), 1520 states have call successors, (1520) [2022-04-05 07:44:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 7330 transitions. [2022-04-05 07:44:46,935 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 7330 transitions. Word has length 260 [2022-04-05 07:44:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:44:46,936 INFO L478 AbstractCegarLoop]: Abstraction has 5446 states and 7330 transitions. [2022-04-05 07:44:46,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-05 07:44:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 7330 transitions. [2022-04-05 07:44:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-04-05 07:44:46,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:44:46,939 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:44:46,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-05 07:44:47,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:47,155 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:44:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:44:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2118395671, now seen corresponding path program 1 times [2022-04-05 07:44:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:44:47,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262722543] [2022-04-05 07:44:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:44:47,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:44:47,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978030329] [2022-04-05 07:44:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:47,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:44:47,164 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:44:47,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-05 07:44:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 07:44:47,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-05 07:44:47,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:44:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-05 07:44:47,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:44:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-04-05 07:44:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:44:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262722543] [2022-04-05 07:44:48,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:44:48,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978030329] [2022-04-05 07:44:48,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978030329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:44:48,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:44:48,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-05 07:44:48,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462832520] [2022-04-05 07:44:48,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:44:48,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-05 07:44:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:44:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-05 07:44:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-05 07:44:48,275 INFO L87 Difference]: Start difference. First operand 5446 states and 7330 transitions. Second operand has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-05 07:44:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:44:49,784 INFO L93 Difference]: Finished difference Result 6122 states and 8220 transitions. [2022-04-05 07:44:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-05 07:44:49,785 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) Word has length 263 [2022-04-05 07:44:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:44:49,794 INFO L225 Difference]: With dead ends: 6122 [2022-04-05 07:44:49,794 INFO L226 Difference]: Without dead ends: 3294 [2022-04-05 07:44:49,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1383, Invalid=2399, Unknown=0, NotChecked=0, Total=3782 [2022-04-05 07:44:49,801 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 602 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 07:44:49,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 637 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 07:44:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2022-04-05 07:44:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3102. [2022-04-05 07:44:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 1941 states have (on average 1.110252447192169) internal successors, (2155), 1953 states have internal predecessors, (2155), 783 states have call successors, (783), 378 states have call predecessors, (783), 377 states have return successors, (781), 770 states have call predecessors, (781), 781 states have call successors, (781) [2022-04-05 07:44:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 3719 transitions. [2022-04-05 07:44:50,447 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 3719 transitions. Word has length 263 [2022-04-05 07:44:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:44:50,447 INFO L478 AbstractCegarLoop]: Abstraction has 3102 states and 3719 transitions. [2022-04-05 07:44:50,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-04-05 07:44:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 3719 transitions. [2022-04-05 07:44:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2022-04-05 07:44:50,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:44:50,454 INFO L499 BasicCegarLoop]: trace histogram [77, 76, 76, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 10, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:44:50,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-05 07:44:50,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:50,671 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:44:50,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:44:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash 678663881, now seen corresponding path program 2 times [2022-04-05 07:44:50,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:44:50,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169836849] [2022-04-05 07:44:50,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:44:50,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:44:50,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034526342] [2022-04-05 07:44:50,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 07:44:50,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:44:50,684 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:44:50,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-05 07:44:50,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 07:44:50,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:44:50,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-05 07:44:50,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:44:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 12389 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-05 07:44:51,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:44:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 1445 refuted. 0 times theorem prover too weak. 11424 trivial. 0 not checked. [2022-04-05 07:44:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:44:53,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169836849] [2022-04-05 07:44:53,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:44:53,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034526342] [2022-04-05 07:44:53,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034526342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:44:53,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:44:53,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-04-05 07:44:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701714836] [2022-04-05 07:44:53,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:44:53,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-05 07:44:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:44:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-05 07:44:53,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-05 07:44:53,016 INFO L87 Difference]: Start difference. First operand 3102 states and 3719 transitions. Second operand has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) [2022-04-05 07:44:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:44:56,473 INFO L93 Difference]: Finished difference Result 5880 states and 7243 transitions. [2022-04-05 07:44:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-05 07:44:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) Word has length 516 [2022-04-05 07:44:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:44:56,504 INFO L225 Difference]: With dead ends: 5880 [2022-04-05 07:44:56,504 INFO L226 Difference]: Without dead ends: 5614 [2022-04-05 07:44:56,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 978 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3809, Invalid=6493, Unknown=0, NotChecked=0, Total=10302 [2022-04-05 07:44:56,508 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 1511 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 1370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1370 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-05 07:44:56,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1007 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1370 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-05 07:44:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5614 states. [2022-04-05 07:44:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5614 to 5276. [2022-04-05 07:44:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 3274 states have (on average 1.107819181429444) internal successors, (3627), 3286 states have internal predecessors, (3627), 1344 states have call successors, (1344), 659 states have call predecessors, (1344), 657 states have return successors, (1341), 1330 states have call predecessors, (1341), 1341 states have call successors, (1341) [2022-04-05 07:44:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 6312 transitions. [2022-04-05 07:44:57,466 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 6312 transitions. Word has length 516 [2022-04-05 07:44:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:44:57,467 INFO L478 AbstractCegarLoop]: Abstraction has 5276 states and 6312 transitions. [2022-04-05 07:44:57,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) [2022-04-05 07:44:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 6312 transitions. [2022-04-05 07:44:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-04-05 07:44:57,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:44:57,474 INFO L499 BasicCegarLoop]: trace histogram [81, 80, 80, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 10, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:44:57,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-05 07:44:57,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-05 07:44:57,687 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:44:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:44:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2865793, now seen corresponding path program 3 times [2022-04-05 07:44:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:44:57,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499700407] [2022-04-05 07:44:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:44:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:44:57,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:44:57,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688865673] [2022-04-05 07:44:57,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 07:44:57,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:44:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:44:57,699 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:44:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-05 07:49:59,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2022-04-05 07:49:59,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 07:49:59,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-05 07:49:59,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 07:50:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 13690 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-05 07:50:00,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 07:50:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 1530 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2022-04-05 07:50:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 07:50:02,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499700407] [2022-04-05 07:50:02,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 07:50:02,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688865673] [2022-04-05 07:50:02,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688865673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 07:50:02,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-05 07:50:02,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-04-05 07:50:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013557260] [2022-04-05 07:50:02,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-05 07:50:02,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-05 07:50:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 07:50:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-05 07:50:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-05 07:50:02,167 INFO L87 Difference]: Start difference. First operand 5276 states and 6312 transitions. Second operand has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) [2022-04-05 07:50:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 07:50:05,411 INFO L93 Difference]: Finished difference Result 5292 states and 6330 transitions. [2022-04-05 07:50:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-05 07:50:05,412 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) Word has length 533 [2022-04-05 07:50:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 07:50:05,430 INFO L225 Difference]: With dead ends: 5292 [2022-04-05 07:50:05,430 INFO L226 Difference]: Without dead ends: 5282 [2022-04-05 07:50:05,433 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1012 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3810, Invalid=6492, Unknown=0, NotChecked=0, Total=10302 [2022-04-05 07:50:05,434 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 1109 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-05 07:50:05,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1109 Valid, 1207 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-05 07:50:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2022-04-05 07:50:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5282. [2022-04-05 07:50:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5282 states, 3281 states have (on average 1.1017982322462663) internal successors, (3615), 3293 states have internal predecessors, (3615), 1343 states have call successors, (1343), 658 states have call predecessors, (1343), 657 states have return successors, (1341), 1330 states have call predecessors, (1341), 1341 states have call successors, (1341) [2022-04-05 07:50:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 6299 transitions. [2022-04-05 07:50:06,575 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 6299 transitions. Word has length 533 [2022-04-05 07:50:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 07:50:06,576 INFO L478 AbstractCegarLoop]: Abstraction has 5282 states and 6299 transitions. [2022-04-05 07:50:06,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) [2022-04-05 07:50:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 6299 transitions. [2022-04-05 07:50:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2022-04-05 07:50:06,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 07:50:06,590 INFO L499 BasicCegarLoop]: trace histogram [133, 132, 132, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 18, 17, 17, 17, 17, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:50:06,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-05 07:50:06,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-05 07:50:06,803 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 07:50:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 07:50:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -652662076, now seen corresponding path program 4 times [2022-04-05 07:50:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 07:50:06,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478716020] [2022-04-05 07:50:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 07:50:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 07:50:06,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 07:50:06,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842073940] [2022-04-05 07:50:06,833 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 07:50:06,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 07:50:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 07:50:06,838 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 07:50:06,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-05 07:50:24,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 07:50:24,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-05 07:50:24,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-05 07:50:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 07:50:31,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-05 07:50:31,872 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-05 07:50:31,873 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 07:50:31,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-05 07:50:32,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-05 07:50:32,090 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 07:50:32,092 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 07:50:32,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 07:50:32 BasicIcfg [2022-04-05 07:50:32,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 07:50:32,238 INFO L158 Benchmark]: Toolchain (without parser) took 807111.19ms. Allocated memory was 178.3MB in the beginning and 984.6MB in the end (delta: 806.4MB). Free memory was 124.9MB in the beginning and 715.1MB in the end (delta: -590.2MB). Peak memory consumption was 216.2MB. Max. memory is 8.0GB. [2022-04-05 07:50:32,239 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 141.3MB in the beginning and 141.2MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 07:50:32,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.51ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 124.6MB in the beginning and 194.7MB in the end (delta: -70.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-05 07:50:32,245 INFO L158 Benchmark]: Boogie Preprocessor took 21.09ms. Allocated memory is still 219.2MB. Free memory was 194.7MB in the beginning and 193.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 07:50:32,245 INFO L158 Benchmark]: RCFGBuilder took 232.82ms. Allocated memory is still 219.2MB. Free memory was 193.1MB in the beginning and 181.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-05 07:50:32,246 INFO L158 Benchmark]: IcfgTransformer took 17.44ms. Allocated memory is still 219.2MB. Free memory was 181.2MB in the beginning and 179.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-05 07:50:32,246 INFO L158 Benchmark]: TraceAbstraction took 806630.48ms. Allocated memory was 219.2MB in the beginning and 984.6MB in the end (delta: 765.5MB). Free memory was 179.1MB in the beginning and 715.1MB in the end (delta: -536.0MB). Peak memory consumption was 229.8MB. Max. memory is 8.0GB. [2022-04-05 07:50:32,246 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.10ms. Allocated memory is still 178.3MB. Free memory was 141.3MB in the beginning and 141.2MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.51ms. Allocated memory was 178.3MB in the beginning and 219.2MB in the end (delta: 40.9MB). Free memory was 124.6MB in the beginning and 194.7MB in the end (delta: -70.1MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.09ms. Allocated memory is still 219.2MB. Free memory was 194.7MB in the beginning and 193.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 232.82ms. Allocated memory is still 219.2MB. Free memory was 193.1MB in the beginning and 181.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 17.44ms. Allocated memory is still 219.2MB. Free memory was 181.2MB in the beginning and 179.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 806630.48ms. Allocated memory was 219.2MB in the beginning and 984.6MB in the end (delta: 765.5MB). Free memory was 179.1MB in the beginning and 715.1MB in the end (delta: -536.0MB). Peak memory consumption was 229.8MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=53, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=2584, y=4181] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=2584, y=4181] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, counter++=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, counter++=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=1597, b=987, c=987, counter=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=987, counter=9, counter++=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, counter++=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=1597, b=987, c=610, counter=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, counter++=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=987, b=610, c=610, counter=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=610, counter=12, counter++=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=987, b=610, c=987, counter=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, counter++=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=987, b=610, c=377, counter=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, counter++=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=610, b=377, c=377, counter=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=15, counter++=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=610, b=377, c=610, counter=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, counter++=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=610, b=377, c=233, counter=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, counter++=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=377, b=233, c=233, counter=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=18, counter++=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=377, b=233, c=377, counter=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, counter++=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=377, b=233, c=144, counter=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, counter++=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=233, b=144, c=144, counter=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=21, counter++=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=233, b=144, c=233, counter=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, counter++=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=233, b=144, c=89, counter=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, counter++=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=144, b=89, c=89, counter=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=24, counter++=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=144, b=89, c=144, counter=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, counter++=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=144, b=89, c=55, counter=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, counter++=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=89, b=55, c=55, counter=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=27, counter++=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=89, b=55, c=89, counter=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, counter++=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=89, b=55, c=34, counter=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, counter++=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=30, counter++=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, counter++=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=55, b=34, c=21, counter=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, counter++=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=33, counter++=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, counter++=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=34, b=21, c=13, counter=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, counter++=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=36, counter++=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, counter++=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=21, b=13, c=8, counter=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, counter++=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=39, counter++=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, counter++=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=13, b=8, c=5, counter=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, counter++=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=42, counter++=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, counter++=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=8, b=5, c=3, counter=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, counter++=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=45, counter++=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, counter++=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=5, b=3, c=2, counter=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, counter++=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=48, counter++=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, counter++=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=3, b=2, c=1, counter=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, counter++=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=51, counter++=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND FALSE !(counter++<50) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 806.4s, OverallIterations: 27, TraceHistogramMax: 133, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 366.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 47 mSolverCounterUnknown, 5733 SdHoareTripleChecker+Valid, 181.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5655 mSDsluCounter, 8939 SdHoareTripleChecker+Invalid, 180.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6992 mSDsCounter, 5359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9538 IncrementalHoareTripleChecker+Invalid, 14944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5359 mSolverCounterUnsat, 1947 mSDtfsCounter, 9538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6208 GetRequests, 5512 SyntacticMatches, 20 SemanticMatches, 676 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5492 ImplicationChecksByTransitivity, 211.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5446occurred in iteration=23, InterpolantAutomatonStates: 610, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 1304 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 320.5s SatisfiabilityAnalysisTime, 99.6s InterpolantComputationTime, 4072 NumberOfCodeBlocks, 3952 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5817 ConstructedInterpolants, 0 QuantifiedInterpolants, 24166 SizeOfPredicates, 214 NumberOfNonLiveVariables, 8380 ConjunctsInSsa, 773 ConjunctsInUnsatCore, 44 InterpolantComputations, 7 PerfectInterpolantSequences, 37079/73248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-05 07:50:32,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...