/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/egcd3-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 23:52:40,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 23:52:40,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 23:52:40,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 23:52:40,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 23:52:40,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 23:52:40,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 23:52:40,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 23:52:40,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 23:52:40,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 23:52:40,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 23:52:40,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 23:52:40,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 23:52:40,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 23:52:40,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 23:52:40,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 23:52:40,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 23:52:40,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 23:52:40,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 23:52:40,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 23:52:40,405 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 23:52:40,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 23:52:40,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 23:52:40,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 23:52:40,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 23:52:40,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 23:52:40,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 23:52:40,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 23:52:40,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 23:52:40,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 23:52:40,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 23:52:40,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 23:52:40,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 23:52:40,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 23:52:40,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 23:52:40,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 23:52:40,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 23:52:40,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 23:52:40,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 23:52:40,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 23:52:40,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 23:52:40,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 23:52:40,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-18 23:52:40,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 23:52:40,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 23:52:40,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 23:52:40,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 23:52:40,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 23:52:40,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 23:52:40,468 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 23:52:40,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 23:52:40,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 23:52:40,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 23:52:40,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 23:52:40,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 23:52:40,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 23:52:40,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 23:52:40,471 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-18 23:52:40,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-18 23:52:40,472 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-18 23:52:40,472 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 23:52:40,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 23:52:40,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 23:52:40,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 23:52:40,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 23:52:40,662 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 23:52:40,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-03-18 23:52:40,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273c10714/f0315df31f2b4335958390b74f53a26d/FLAG11be7c1e8 [2022-03-18 23:52:41,069 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 23:52:41,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-03-18 23:52:41,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273c10714/f0315df31f2b4335958390b74f53a26d/FLAG11be7c1e8 [2022-03-18 23:52:41,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273c10714/f0315df31f2b4335958390b74f53a26d [2022-03-18 23:52:41,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 23:52:41,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-18 23:52:41,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 23:52:41,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 23:52:41,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 23:52:41,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317b315e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41, skipping insertion in model container [2022-03-18 23:52:41,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 23:52:41,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 23:52:41,640 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/egcd3-ll_unwindbound100.c[490,503] [2022-03-18 23:52:41,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 23:52:41,660 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 23:52:41,672 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/egcd3-ll_unwindbound100.c[490,503] [2022-03-18 23:52:41,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 23:52:41,692 INFO L208 MainTranslator]: Completed translation [2022-03-18 23:52:41,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41 WrapperNode [2022-03-18 23:52:41,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 23:52:41,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 23:52:41,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 23:52:41,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 23:52:41,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 23:52:41,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 23:52:41,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 23:52:41,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 23:52:41,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 23:52:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:41,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-18 23:52:41,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-18 23:52:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 23:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 23:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 23:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-18 23:52:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 23:52:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 23:52:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 23:52:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 23:52:41,787 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 23:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 23:52:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 23:52:41,837 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 23:52:41,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 23:52:41,987 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 23:52:41,992 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 23:52:41,992 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-18 23:52:41,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:52:41 BoogieIcfgContainer [2022-03-18 23:52:41,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 23:52:41,994 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-18 23:52:41,994 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-18 23:52:41,998 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-18 23:52:42,002 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:52:41" (1/1) ... [2022-03-18 23:52:42,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 11:52:42 BasicIcfg [2022-03-18 23:52:42,035 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-18 23:52:42,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 23:52:42,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 23:52:42,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 23:52:42,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 11:52:41" (1/4) ... [2022-03-18 23:52:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe3a7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:52:42, skipping insertion in model container [2022-03-18 23:52:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:52:41" (2/4) ... [2022-03-18 23:52:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe3a7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:52:42, skipping insertion in model container [2022-03-18 23:52:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:52:41" (3/4) ... [2022-03-18 23:52:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe3a7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 11:52:42, skipping insertion in model container [2022-03-18 23:52:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 11:52:42" (4/4) ... [2022-03-18 23:52:42,041 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.cqvasr [2022-03-18 23:52:42,045 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 23:52:42,045 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 23:52:42,078 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 23:52:42,082 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-18 23:52:42,083 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 23:52:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-03-18 23:52:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 23:52:42,097 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:42,097 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:52:42,098 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:42,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-03-18 23:52:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181668089] [2022-03-18 23:52:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 23:52:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-18 23:52:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-18 23:52:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:42,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181668089] [2022-03-18 23:52:42,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181668089] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:42,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:42,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 23:52:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667177581] [2022-03-18 23:52:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:42,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 23:52:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 23:52:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 23:52:42,311 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:42,411 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-03-18 23:52:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 23:52:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-03-18 23:52:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:42,419 INFO L225 Difference]: With dead ends: 74 [2022-03-18 23:52:42,420 INFO L226 Difference]: Without dead ends: 36 [2022-03-18 23:52:42,423 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 23:52:42,426 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:42,427 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-18 23:52:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-03-18 23:52:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-18 23:52:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-03-18 23:52:42,455 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-03-18 23:52:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:42,455 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-03-18 23:52:42,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-03-18 23:52:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-18 23:52:42,457 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:42,457 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:52:42,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 23:52:42,457 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:42,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-03-18 23:52:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:42,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657973828] [2022-03-18 23:52:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:42,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:42,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550256064] [2022-03-18 23:52:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:42,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:42,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:42,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:42,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-18 23:52:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:42,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-18 23:52:42,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:42,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657973828] [2022-03-18 23:52:42,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550256064] [2022-03-18 23:52:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550256064] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 23:52:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913615996] [2022-03-18 23:52:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:42,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 23:52:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 23:52:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 23:52:42,685 INFO L87 Difference]: Start difference. First operand 35 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:42,703 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-03-18 23:52:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 23:52:42,705 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-03-18 23:52:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:42,706 INFO L225 Difference]: With dead ends: 44 [2022-03-18 23:52:42,706 INFO L226 Difference]: Without dead ends: 37 [2022-03-18 23:52:42,707 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-03-18 23:52:42,708 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:42,708 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-18 23:52:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-03-18 23:52:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-18 23:52:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-03-18 23:52:42,714 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-03-18 23:52:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:42,715 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-03-18 23:52:42,715 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-03-18 23:52:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-18 23:52:42,716 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:42,716 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:52:42,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:42,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:42,930 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-03-18 23:52:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:42,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010977146] [2022-03-18 23:52:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:42,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672364737] [2022-03-18 23:52:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:42,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:42,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:42,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:42,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-18 23:52:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:43,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 23:52:43,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 23:52:43,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010977146] [2022-03-18 23:52:43,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672364737] [2022-03-18 23:52:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672364737] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 23:52:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747016165] [2022-03-18 23:52:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:43,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 23:52:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:43,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 23:52:43,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:52:43,091 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-18 23:52:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:43,135 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-03-18 23:52:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 23:52:43,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-03-18 23:52:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:43,136 INFO L225 Difference]: With dead ends: 57 [2022-03-18 23:52:43,136 INFO L226 Difference]: Without dead ends: 50 [2022-03-18 23:52:43,136 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-18 23:52:43,137 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:43,137 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 169 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-18 23:52:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-03-18 23:52:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-18 23:52:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-03-18 23:52:43,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-03-18 23:52:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:43,143 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-03-18 23:52:43,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-18 23:52:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-03-18 23:52:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-18 23:52:43,144 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:43,144 INFO L500 BasicCegarLoop]: trace histogram [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] [2022-03-18 23:52:43,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:43,359 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,SelfDestructingSolverStorable2 [2022-03-18 23:52:43,360 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:43,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-03-18 23:52:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:43,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503810622] [2022-03-18 23:52:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:43,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:43,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157543784] [2022-03-18 23:52:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:43,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:43,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:43,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:43,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-18 23:52:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:43,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 23:52:43,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:43,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:43,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503810622] [2022-03-18 23:52:43,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:43,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157543784] [2022-03-18 23:52:43,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157543784] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:43,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:43,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 23:52:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970657214] [2022-03-18 23:52:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:43,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 23:52:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 23:52:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-18 23:52:43,498 INFO L87 Difference]: Start difference. First operand 38 states and 48 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:43,516 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-03-18 23:52:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 23:52:43,517 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-03-18 23:52:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:43,517 INFO L225 Difference]: With dead ends: 62 [2022-03-18 23:52:43,517 INFO L226 Difference]: Without dead ends: 40 [2022-03-18 23:52:43,518 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-03-18 23:52:43,518 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:43,518 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-18 23:52:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-18 23:52:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-18 23:52:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-03-18 23:52:43,523 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-03-18 23:52:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:43,523 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-03-18 23:52:43,524 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-03-18 23:52:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-18 23:52:43,524 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:43,524 INFO L500 BasicCegarLoop]: trace histogram [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-03-18 23:52:43,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:43,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:43,741 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-03-18 23:52:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:43,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944361247] [2022-03-18 23:52:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:43,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:43,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952569766] [2022-03-18 23:52:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:43,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:43,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:43,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:43,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-18 23:52:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:43,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-18 23:52:43,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 23:52:44,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:44,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944361247] [2022-03-18 23:52:44,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952569766] [2022-03-18 23:52:44,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952569766] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:44,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:44,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-18 23:52:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390391094] [2022-03-18 23:52:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:44,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 23:52:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 23:52:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-18 23:52:44,018 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-18 23:52:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:44,182 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-03-18 23:52:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-18 23:52:44,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-03-18 23:52:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:44,183 INFO L225 Difference]: With dead ends: 68 [2022-03-18 23:52:44,183 INFO L226 Difference]: Without dead ends: 66 [2022-03-18 23:52:44,184 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-18 23:52:44,184 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 79 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:44,184 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 239 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-18 23:52:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-03-18 23:52:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-18 23:52:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-03-18 23:52:44,191 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-03-18 23:52:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:44,192 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-03-18 23:52:44,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-18 23:52:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-03-18 23:52:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-18 23:52:44,193 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:44,193 INFO L500 BasicCegarLoop]: trace histogram [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-03-18 23:52:44,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:44,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:44,411 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-03-18 23:52:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:44,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597756733] [2022-03-18 23:52:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:44,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:44,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191691902] [2022-03-18 23:52:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:44,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:44,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:44,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-18 23:52:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:44,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-18 23:52:44,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:44,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:44,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597756733] [2022-03-18 23:52:44,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:44,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191691902] [2022-03-18 23:52:44,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191691902] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:44,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:44,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-18 23:52:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137150973] [2022-03-18 23:52:44,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:44,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 23:52:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 23:52:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-18 23:52:44,602 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 23:52:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:44,708 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-03-18 23:52:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 23:52:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-03-18 23:52:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:44,709 INFO L225 Difference]: With dead ends: 151 [2022-03-18 23:52:44,710 INFO L226 Difference]: Without dead ends: 144 [2022-03-18 23:52:44,710 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-03-18 23:52:44,710 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:44,710 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 272 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-18 23:52:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-03-18 23:52:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-03-18 23:52:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-03-18 23:52:44,735 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-03-18 23:52:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:44,736 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-03-18 23:52:44,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 23:52:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-03-18 23:52:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-18 23:52:44,741 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:44,741 INFO L500 BasicCegarLoop]: trace histogram [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] [2022-03-18 23:52:44,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:44,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:44,959 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-03-18 23:52:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:44,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713839507] [2022-03-18 23:52:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:44,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:44,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386534614] [2022-03-18 23:52:44,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:44,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:44,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:44,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-18 23:52:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:45,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-18 23:52:45,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 23:52:45,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 23:52:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713839507] [2022-03-18 23:52:45,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386534614] [2022-03-18 23:52:45,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386534614] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:45,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:45,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-18 23:52:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664145673] [2022-03-18 23:52:45,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:45,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 23:52:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 23:52:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-18 23:52:45,192 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:45,337 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2022-03-18 23:52:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-18 23:52:45,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-03-18 23:52:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:45,339 INFO L225 Difference]: With dead ends: 187 [2022-03-18 23:52:45,339 INFO L226 Difference]: Without dead ends: 175 [2022-03-18 23:52:45,339 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 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-03-18 23:52:45,339 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:45,340 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 362 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-03-18 23:52:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-03-18 23:52:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-18 23:52:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-03-18 23:52:45,366 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-03-18 23:52:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:45,366 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-03-18 23:52:45,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-03-18 23:52:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-18 23:52:45,366 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:45,367 INFO L500 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-03-18 23:52:45,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:45,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:45,567 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-03-18 23:52:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:45,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215328752] [2022-03-18 23:52:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:45,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:45,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:45,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377740435] [2022-03-18 23:52:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:45,578 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:45,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-18 23:52:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:45,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-18 23:52:45,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 23:52:45,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:45,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215328752] [2022-03-18 23:52:45,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:45,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377740435] [2022-03-18 23:52:45,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377740435] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:45,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:45,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-18 23:52:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900551433] [2022-03-18 23:52:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:45,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 23:52:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 23:52:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-18 23:52:45,820 INFO L87 Difference]: Start difference. First operand 132 states and 180 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-18 23:52:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:45,986 INFO L93 Difference]: Finished difference Result 157 states and 210 transitions. [2022-03-18 23:52:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-18 23:52:45,987 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-03-18 23:52:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:45,989 INFO L225 Difference]: With dead ends: 157 [2022-03-18 23:52:45,989 INFO L226 Difference]: Without dead ends: 155 [2022-03-18 23:52:45,989 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-18 23:52:45,989 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:45,990 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 269 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-03-18 23:52:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-03-18 23:52:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-18 23:52:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-03-18 23:52:46,007 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-03-18 23:52:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:46,007 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-03-18 23:52:46,007 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-18 23:52:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-03-18 23:52:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-18 23:52:46,010 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:46,010 INFO L500 BasicCegarLoop]: trace histogram [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-03-18 23:52:46,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:46,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:46,229 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:46,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-03-18 23:52:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:46,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164118208] [2022-03-18 23:52:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:46,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:46,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296332039] [2022-03-18 23:52:46,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:46,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:46,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:46,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:46,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-18 23:52:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:46,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-18 23:52:46,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 23:52:46,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164118208] [2022-03-18 23:52:46,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296332039] [2022-03-18 23:52:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296332039] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:46,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:46,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-03-18 23:52:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894481881] [2022-03-18 23:52:46,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:46,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-18 23:52:46,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-18 23:52:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-18 23:52:46,571 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-18 23:52:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:46,703 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-03-18 23:52:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 23:52:46,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-03-18 23:52:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:46,704 INFO L225 Difference]: With dead ends: 179 [2022-03-18 23:52:46,704 INFO L226 Difference]: Without dead ends: 177 [2022-03-18 23:52:46,705 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-03-18 23:52:46,705 INFO L912 BasicCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:46,705 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 409 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-03-18 23:52:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-03-18 23:52:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-03-18 23:52:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-03-18 23:52:46,718 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-03-18 23:52:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:46,718 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-03-18 23:52:46,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-18 23:52:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-03-18 23:52:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-18 23:52:46,718 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:46,718 INFO L500 BasicCegarLoop]: trace histogram [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-03-18 23:52:46,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:46,936 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,SelfDestructingSolverStorable8 [2022-03-18 23:52:46,936 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-03-18 23:52:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:46,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431442697] [2022-03-18 23:52:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:46,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:46,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906868794] [2022-03-18 23:52:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:46,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:46,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:46,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:46,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-18 23:52:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:46,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-18 23:52:46,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:47,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:47,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:47,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431442697] [2022-03-18 23:52:47,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:47,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906868794] [2022-03-18 23:52:47,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906868794] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:47,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:47,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 23:52:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978630798] [2022-03-18 23:52:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:47,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 23:52:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 23:52:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:52:47,062 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:47,089 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-03-18 23:52:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 23:52:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-03-18 23:52:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:47,091 INFO L225 Difference]: With dead ends: 241 [2022-03-18 23:52:47,091 INFO L226 Difference]: Without dead ends: 174 [2022-03-18 23:52:47,091 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:52:47,092 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:47,092 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-18 23:52:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-03-18 23:52:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-03-18 23:52:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-03-18 23:52:47,122 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-03-18 23:52:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:47,123 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-03-18 23:52:47,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-18 23:52:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-03-18 23:52:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-18 23:52:47,123 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:47,123 INFO L500 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:52:47,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:47,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-18 23:52:47,341 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-03-18 23:52:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:47,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188794170] [2022-03-18 23:52:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:47,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219300034] [2022-03-18 23:52:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:47,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:47,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:47,351 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:47,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-18 23:52:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:47,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 23:52:47,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-18 23:52:47,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:47,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188794170] [2022-03-18 23:52:47,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:47,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219300034] [2022-03-18 23:52:47,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219300034] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:47,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:47,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 23:52:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340636786] [2022-03-18 23:52:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:47,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 23:52:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 23:52:47,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 23:52:47,479 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-18 23:52:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:47,521 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2022-03-18 23:52:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 23:52:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-03-18 23:52:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:47,523 INFO L225 Difference]: With dead ends: 239 [2022-03-18 23:52:47,523 INFO L226 Difference]: Without dead ends: 237 [2022-03-18 23:52:47,523 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:52:47,524 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:47,524 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 155 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-18 23:52:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-03-18 23:52:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-03-18 23:52:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-03-18 23:52:47,539 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-03-18 23:52:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:47,539 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-03-18 23:52:47,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-18 23:52:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-03-18 23:52:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-18 23:52:47,539 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:47,539 INFO L500 BasicCegarLoop]: trace histogram [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-03-18 23:52:47,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:47,757 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,SelfDestructingSolverStorable10 [2022-03-18 23:52:47,757 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-03-18 23:52:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:47,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835463651] [2022-03-18 23:52:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:47,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107625926] [2022-03-18 23:52:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:47,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:47,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:47,766 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:47,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-18 23:52:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:47,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-18 23:52:47,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:48,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:48,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835463651] [2022-03-18 23:52:48,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:48,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107625926] [2022-03-18 23:52:48,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107625926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:48,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:48,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-03-18 23:52:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273462325] [2022-03-18 23:52:48,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:48,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 23:52:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:48,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 23:52:48,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-18 23:52:48,133 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 23:52:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:48,761 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2022-03-18 23:52:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 23:52:48,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-03-18 23:52:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:48,764 INFO L225 Difference]: With dead ends: 392 [2022-03-18 23:52:48,764 INFO L226 Difference]: Without dead ends: 390 [2022-03-18 23:52:48,764 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-03-18 23:52:48,764 INFO L912 BasicCegarLoop]: 66 mSDtfsCounter, 170 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:48,764 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 370 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-18 23:52:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-03-18 23:52:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-03-18 23:52:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-03-18 23:52:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-03-18 23:52:48,833 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-03-18 23:52:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:48,833 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-03-18 23:52:48,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-18 23:52:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-03-18 23:52:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-18 23:52:48,834 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:48,834 INFO L500 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:52:48,852 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-03-18 23:52:49,052 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,SelfDestructingSolverStorable11 [2022-03-18 23:52:49,052 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-03-18 23:52:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:49,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740627212] [2022-03-18 23:52:49,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:49,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:49,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910992754] [2022-03-18 23:52:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:49,061 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:49,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-18 23:52:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:49,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 23:52:49,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-18 23:52:49,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:49,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740627212] [2022-03-18 23:52:49,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:49,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910992754] [2022-03-18 23:52:49,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910992754] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:49,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:49,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 23:52:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638692601] [2022-03-18 23:52:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:49,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 23:52:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:49,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 23:52:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 23:52:49,185 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-03-18 23:52:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:49,255 INFO L93 Difference]: Finished difference Result 566 states and 887 transitions. [2022-03-18 23:52:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 23:52:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-03-18 23:52:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:49,257 INFO L225 Difference]: With dead ends: 566 [2022-03-18 23:52:49,257 INFO L226 Difference]: Without dead ends: 564 [2022-03-18 23:52:49,258 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:52:49,258 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:49,258 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-03-18 23:52:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-03-18 23:52:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-03-18 23:52:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-03-18 23:52:49,298 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-03-18 23:52:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:49,299 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-03-18 23:52:49,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-03-18 23:52:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-03-18 23:52:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-18 23:52:49,299 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:49,299 INFO L500 BasicCegarLoop]: trace histogram [4, 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] [2022-03-18 23:52:49,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:49,513 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,SelfDestructingSolverStorable12 [2022-03-18 23:52:49,513 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-03-18 23:52:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:49,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989053808] [2022-03-18 23:52:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:49,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:49,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590235469] [2022-03-18 23:52:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:49,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:49,522 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:49,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-18 23:52:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:49,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-18 23:52:49,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 23:52:49,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 23:52:49,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989053808] [2022-03-18 23:52:49,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590235469] [2022-03-18 23:52:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590235469] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:49,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-03-18 23:52:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121405313] [2022-03-18 23:52:49,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:49,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 23:52:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:49,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 23:52:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-03-18 23:52:49,739 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 23:52:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:49,964 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2022-03-18 23:52:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-18 23:52:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-03-18 23:52:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:49,968 INFO L225 Difference]: With dead ends: 1127 [2022-03-18 23:52:49,969 INFO L226 Difference]: Without dead ends: 770 [2022-03-18 23:52:49,971 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-03-18 23:52:49,971 INFO L912 BasicCegarLoop]: 69 mSDtfsCounter, 169 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:49,971 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 342 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-03-18 23:52:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-03-18 23:52:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-03-18 23:52:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-03-18 23:52:50,035 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-03-18 23:52:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:50,035 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-03-18 23:52:50,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 23:52:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-03-18 23:52:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-18 23:52:50,036 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:50,036 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 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-03-18 23:52:50,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:50,254 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,SelfDestructingSolverStorable13 [2022-03-18 23:52:50,254 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:50,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 841576990, now seen corresponding path program 1 times [2022-03-18 23:52:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:50,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058371423] [2022-03-18 23:52:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:50,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:50,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366869453] [2022-03-18 23:52:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:50,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:50,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:50,271 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-18 23:52:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:50,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 23:52:50,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:50,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-18 23:52:50,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:50,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058371423] [2022-03-18 23:52:50,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:50,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366869453] [2022-03-18 23:52:50,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366869453] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:50,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:50,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-18 23:52:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768046223] [2022-03-18 23:52:50,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:50,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 23:52:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:50,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 23:52:50,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-18 23:52:50,493 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 23:52:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:50,782 INFO L93 Difference]: Finished difference Result 1597 states and 2379 transitions. [2022-03-18 23:52:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-18 23:52:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-03-18 23:52:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:50,786 INFO L225 Difference]: With dead ends: 1597 [2022-03-18 23:52:50,786 INFO L226 Difference]: Without dead ends: 1119 [2022-03-18 23:52:50,787 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-03-18 23:52:50,788 INFO L912 BasicCegarLoop]: 75 mSDtfsCounter, 255 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:50,788 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 319 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 23:52:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-03-18 23:52:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-03-18 23:52:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-03-18 23:52:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-03-18 23:52:50,872 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-03-18 23:52:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:50,873 INFO L478 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-03-18 23:52:50,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-18 23:52:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-03-18 23:52:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-18 23:52:50,873 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:50,873 INFO L500 BasicCegarLoop]: trace histogram [4, 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] [2022-03-18 23:52:50,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:51,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:51,091 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash -799775801, now seen corresponding path program 2 times [2022-03-18 23:52:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:51,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029156837] [2022-03-18 23:52:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:51,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:51,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140579398] [2022-03-18 23:52:51,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:52:51,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:51,100 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:51,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-18 23:52:51,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:52:51,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:52:51,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-18 23:52:51,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 23:52:51,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:52:51,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:51,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029156837] [2022-03-18 23:52:51,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:51,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140579398] [2022-03-18 23:52:51,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140579398] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:52:51,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:52:51,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 23:52:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215363813] [2022-03-18 23:52:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:52:51,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 23:52:51,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:51,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 23:52:51,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-18 23:52:51,200 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-18 23:52:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:51,353 INFO L93 Difference]: Finished difference Result 1700 states and 2539 transitions. [2022-03-18 23:52:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 23:52:51,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-03-18 23:52:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:51,358 INFO L225 Difference]: With dead ends: 1700 [2022-03-18 23:52:51,358 INFO L226 Difference]: Without dead ends: 1234 [2022-03-18 23:52:51,359 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-03-18 23:52:51,360 INFO L912 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:51,360 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 195 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:52:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-18 23:52:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-03-18 23:52:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-03-18 23:52:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-03-18 23:52:51,441 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-03-18 23:52:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:51,441 INFO L478 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-03-18 23:52:51,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-18 23:52:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-03-18 23:52:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-18 23:52:51,442 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:51,442 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:52:51,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:51,655 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,SelfDestructingSolverStorable15 [2022-03-18 23:52:51,655 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-03-18 23:52:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007339101] [2022-03-18 23:52:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:51,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769872379] [2022-03-18 23:52:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:51,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:51,672 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:51,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-18 23:52:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:51,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-18 23:52:51,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-18 23:52:52,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-18 23:52:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007339101] [2022-03-18 23:52:53,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:53,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769872379] [2022-03-18 23:52:53,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769872379] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:53,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:53,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-03-18 23:52:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915394898] [2022-03-18 23:52:53,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:53,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-18 23:52:53,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-18 23:52:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-03-18 23:52:53,024 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-03-18 23:52:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:58,046 INFO L93 Difference]: Finished difference Result 1412 states and 2014 transitions. [2022-03-18 23:52:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-18 23:52:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-03-18 23:52:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:58,074 INFO L225 Difference]: With dead ends: 1412 [2022-03-18 23:52:58,074 INFO L226 Difference]: Without dead ends: 1404 [2022-03-18 23:52:58,075 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-03-18 23:52:58,076 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:58,076 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 676 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-18 23:52:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-03-18 23:52:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-03-18 23:52:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-03-18 23:52:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-03-18 23:52:58,236 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-03-18 23:52:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:58,236 INFO L478 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-03-18 23:52:58,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-03-18 23:52:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-03-18 23:52:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-18 23:52:58,237 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:58,237 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2022-03-18 23:52:58,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:58,451 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,SelfDestructingSolverStorable16 [2022-03-18 23:52:58,451 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1248898955, now seen corresponding path program 1 times [2022-03-18 23:52:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:58,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13066666] [2022-03-18 23:52:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:58,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284562446] [2022-03-18 23:52:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:58,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:52:58,463 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:52:58,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-18 23:52:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:52:58,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-18 23:52:58,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:52:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-18 23:52:58,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:52:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-18 23:52:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:52:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13066666] [2022-03-18 23:52:58,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:52:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284562446] [2022-03-18 23:52:58,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284562446] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:52:58,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:52:58,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-18 23:52:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300844819] [2022-03-18 23:52:58,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:52:58,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-18 23:52:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:52:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-18 23:52:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-18 23:52:58,796 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-03-18 23:52:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:52:59,463 INFO L93 Difference]: Finished difference Result 2565 states and 3679 transitions. [2022-03-18 23:52:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-18 23:52:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-03-18 23:52:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:52:59,472 INFO L225 Difference]: With dead ends: 2565 [2022-03-18 23:52:59,472 INFO L226 Difference]: Without dead ends: 2543 [2022-03-18 23:52:59,473 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2022-03-18 23:52:59,473 INFO L912 BasicCegarLoop]: 85 mSDtfsCounter, 385 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 23:52:59,474 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 488 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 23:52:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-03-18 23:52:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2406. [2022-03-18 23:52:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-03-18 23:52:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3425 transitions. [2022-03-18 23:52:59,774 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3425 transitions. Word has length 64 [2022-03-18 23:52:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:52:59,774 INFO L478 AbstractCegarLoop]: Abstraction has 2406 states and 3425 transitions. [2022-03-18 23:52:59,774 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-03-18 23:52:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3425 transitions. [2022-03-18 23:52:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-18 23:52:59,774 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:52:59,775 INFO L500 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2022-03-18 23:52:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-18 23:52:59,991 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,SelfDestructingSolverStorable17 [2022-03-18 23:52:59,992 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:52:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:52:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash -934249537, now seen corresponding path program 1 times [2022-03-18 23:52:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:52:59,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888853027] [2022-03-18 23:52:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:52:59,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:52:59,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715917328] [2022-03-18 23:52:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:52:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:52:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:53:00,026 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:53:00,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-18 23:53:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:53:00,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-18 23:53:00,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:53:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-03-18 23:53:00,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:53:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-03-18 23:53:00,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:53:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888853027] [2022-03-18 23:53:00,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:53:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715917328] [2022-03-18 23:53:00,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715917328] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-18 23:53:00,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-18 23:53:00,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-03-18 23:53:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552028472] [2022-03-18 23:53:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:53:00,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 23:53:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:53:00,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 23:53:00,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-18 23:53:00,350 INFO L87 Difference]: Start difference. First operand 2406 states and 3425 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-03-18 23:53:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:53:00,678 INFO L93 Difference]: Finished difference Result 2467 states and 3485 transitions. [2022-03-18 23:53:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-18 23:53:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-03-18 23:53:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:53:00,687 INFO L225 Difference]: With dead ends: 2467 [2022-03-18 23:53:00,687 INFO L226 Difference]: Without dead ends: 2465 [2022-03-18 23:53:00,688 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-03-18 23:53:00,688 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:53:00,688 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:53:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-03-18 23:53:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2442. [2022-03-18 23:53:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-03-18 23:53:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3450 transitions. [2022-03-18 23:53:01,002 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3450 transitions. Word has length 67 [2022-03-18 23:53:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:53:01,002 INFO L478 AbstractCegarLoop]: Abstraction has 2442 states and 3450 transitions. [2022-03-18 23:53:01,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-03-18 23:53:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3450 transitions. [2022-03-18 23:53:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-18 23:53:01,006 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:53:01,006 INFO L500 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 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-03-18 23:53:01,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-18 23:53:01,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:53:01,227 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:53:01,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:53:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1422612783, now seen corresponding path program 1 times [2022-03-18 23:53:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:53:01,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52307745] [2022-03-18 23:53:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:53:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:53:01,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:53:01,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728936552] [2022-03-18 23:53:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:53:01,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:53:01,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:53:01,252 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-03-18 23:53:01,265 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-03-18 23:53:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:53:01,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-18 23:53:01,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:53:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-18 23:53:01,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:53:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:53:01,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52307745] [2022-03-18 23:53:01,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:53:01,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728936552] [2022-03-18 23:53:01,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728936552] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:53:01,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:53:01,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-18 23:53:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379778542] [2022-03-18 23:53:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:53:01,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-18 23:53:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:53:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-18 23:53:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-18 23:53:01,405 INFO L87 Difference]: Start difference. First operand 2442 states and 3450 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-18 23:53:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:53:01,726 INFO L93 Difference]: Finished difference Result 4377 states and 6175 transitions. [2022-03-18 23:53:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 23:53:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-03-18 23:53:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:53:01,735 INFO L225 Difference]: With dead ends: 4377 [2022-03-18 23:53:01,735 INFO L226 Difference]: Without dead ends: 2578 [2022-03-18 23:53:01,739 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:53:01,740 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:53:01,740 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:53:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-03-18 23:53:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2372. [2022-03-18 23:53:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-03-18 23:53:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3297 transitions. [2022-03-18 23:53:01,998 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3297 transitions. Word has length 73 [2022-03-18 23:53:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:53:01,998 INFO L478 AbstractCegarLoop]: Abstraction has 2372 states and 3297 transitions. [2022-03-18 23:53:01,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-18 23:53:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3297 transitions. [2022-03-18 23:53:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-18 23:53:01,999 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:53:01,999 INFO L500 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 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-03-18 23:53:02,037 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-03-18 23:53:02,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:53:02,216 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:53:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:53:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1662269742, now seen corresponding path program 2 times [2022-03-18 23:53:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:53:02,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181921579] [2022-03-18 23:53:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:53:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:53:02,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:53:02,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168240340] [2022-03-18 23:53:02,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:53:02,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:53:02,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:53:02,245 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-03-18 23:53:02,247 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-03-18 23:53:02,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:53:02,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:53:02,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-18 23:53:02,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:53:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-03-18 23:53:03,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:53:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-03-18 23:53:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:53:04,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181921579] [2022-03-18 23:53:04,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:53:04,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168240340] [2022-03-18 23:53:04,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168240340] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:53:04,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:53:04,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-03-18 23:53:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873352381] [2022-03-18 23:53:04,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:53:04,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-18 23:53:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:53:04,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-18 23:53:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-03-18 23:53:04,571 INFO L87 Difference]: Start difference. First operand 2372 states and 3297 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-03-18 23:53:13,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:53:17,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:53:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:53:20,033 INFO L93 Difference]: Finished difference Result 2869 states and 3894 transitions. [2022-03-18 23:53:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-18 23:53:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-03-18 23:53:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:53:20,057 INFO L225 Difference]: With dead ends: 2869 [2022-03-18 23:53:20,057 INFO L226 Difference]: Without dead ends: 2863 [2022-03-18 23:53:20,058 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-03-18 23:53:20,059 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 297 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 303 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-03-18 23:53:20,060 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 848 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1026 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2022-03-18 23:53:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-03-18 23:53:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2736. [2022-03-18 23:53:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-03-18 23:53:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3745 transitions. [2022-03-18 23:53:20,605 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3745 transitions. Word has length 75 [2022-03-18 23:53:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:53:20,605 INFO L478 AbstractCegarLoop]: Abstraction has 2736 states and 3745 transitions. [2022-03-18 23:53:20,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-03-18 23:53:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3745 transitions. [2022-03-18 23:53:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-18 23:53:20,606 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:53:20,606 INFO L500 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-03-18 23:53:20,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-18 23:53:20,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-18 23:53:20,809 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:53:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:53:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 612727057, now seen corresponding path program 1 times [2022-03-18 23:53:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:53:20,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869977061] [2022-03-18 23:53:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:53:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:53:20,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:53:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472165636] [2022-03-18 23:53:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:53:20,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:53:20,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:53:20,820 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-03-18 23:53:20,821 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-03-18 23:53:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:53:20,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-18 23:53:20,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:53:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-03-18 23:53:22,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:53:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-03-18 23:53:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:53:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869977061] [2022-03-18 23:53:27,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:53:27,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472165636] [2022-03-18 23:53:27,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472165636] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:53:27,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:53:27,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-03-18 23:53:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230129706] [2022-03-18 23:53:27,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:53:27,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-18 23:53:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:53:27,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-18 23:53:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-03-18 23:53:27,514 INFO L87 Difference]: Start difference. First operand 2736 states and 3745 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-18 23:53:37,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:53:43,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:53:57,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:54:15,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:54:16,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:54:24,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:54:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:54:34,730 INFO L93 Difference]: Finished difference Result 3394 states and 4591 transitions. [2022-03-18 23:54:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-18 23:54:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-03-18 23:54:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:54:34,756 INFO L225 Difference]: With dead ends: 3394 [2022-03-18 23:54:34,756 INFO L226 Difference]: Without dead ends: 3363 [2022-03-18 23:54:34,763 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=1914, Invalid=9428, Unknown=0, NotChecked=0, Total=11342 [2022-03-18 23:54:34,764 INFO L912 BasicCegarLoop]: 89 mSDtfsCounter, 405 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 519 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2022-03-18 23:54:34,764 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 1241 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1495 Invalid, 2 Unknown, 0 Unchecked, 20.7s Time] [2022-03-18 23:54:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2022-03-18 23:54:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3022. [2022-03-18 23:54:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2209 states have (on average 1.2928927116342237) internal successors, (2856), 2253 states have internal predecessors, (2856), 637 states have call successors, (637), 177 states have call predecessors, (637), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-03-18 23:54:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4123 transitions. [2022-03-18 23:54:35,335 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4123 transitions. Word has length 88 [2022-03-18 23:54:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:54:35,335 INFO L478 AbstractCegarLoop]: Abstraction has 3022 states and 4123 transitions. [2022-03-18 23:54:35,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-18 23:54:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4123 transitions. [2022-03-18 23:54:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-18 23:54:35,337 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:54:35,337 INFO L500 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:54:35,354 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-03-18 23:54:35,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-18 23:54:35,538 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:54:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:54:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405093, now seen corresponding path program 3 times [2022-03-18 23:54:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:54:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229797768] [2022-03-18 23:54:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:54:35,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:54:35,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:54:35,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [680345009] [2022-03-18 23:54:35,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 23:54:35,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:54:35,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:54:35,546 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-03-18 23:54:35,547 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-03-18 23:54:35,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-18 23:54:35,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:54:35,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-18 23:54:35,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:54:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-03-18 23:54:36,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:54:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-03-18 23:54:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:54:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229797768] [2022-03-18 23:54:36,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:54:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680345009] [2022-03-18 23:54:36,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680345009] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:54:36,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:54:36,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-03-18 23:54:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804623468] [2022-03-18 23:54:36,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:54:36,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-18 23:54:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:54:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-18 23:54:36,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-03-18 23:54:36,376 INFO L87 Difference]: Start difference. First operand 3022 states and 4123 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-03-18 23:54:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:54:40,843 INFO L93 Difference]: Finished difference Result 3244 states and 4417 transitions. [2022-03-18 23:54:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-18 23:54:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-03-18 23:54:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:54:40,852 INFO L225 Difference]: With dead ends: 3244 [2022-03-18 23:54:40,852 INFO L226 Difference]: Without dead ends: 3232 [2022-03-18 23:54:40,853 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-03-18 23:54:40,854 INFO L912 BasicCegarLoop]: 67 mSDtfsCounter, 107 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-18 23:54:40,854 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 677 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-18 23:54:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-03-18 23:54:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2949. [2022-03-18 23:54:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2141 states have (on average 1.2919196637085475) internal successors, (2766), 2180 states have internal predecessors, (2766), 632 states have call successors, (632), 177 states have call predecessors, (632), 175 states have return successors, (630), 591 states have call predecessors, (630), 630 states have call successors, (630) [2022-03-18 23:54:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4028 transitions. [2022-03-18 23:54:41,422 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4028 transitions. Word has length 97 [2022-03-18 23:54:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:54:41,422 INFO L478 AbstractCegarLoop]: Abstraction has 2949 states and 4028 transitions. [2022-03-18 23:54:41,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-03-18 23:54:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4028 transitions. [2022-03-18 23:54:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-18 23:54:41,424 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:54:41,424 INFO L500 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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] [2022-03-18 23:54:41,440 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-03-18 23:54:41,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:54:41,638 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:54:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:54:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1037830812, now seen corresponding path program 1 times [2022-03-18 23:54:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:54:41,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722592297] [2022-03-18 23:54:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:54:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:54:41,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:54:41,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996041701] [2022-03-18 23:54:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:54:41,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:54:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:54:41,652 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-03-18 23:54:41,653 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-03-18 23:54:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:54:41,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-18 23:54:41,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:54:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-18 23:54:41,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:54:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-03-18 23:54:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:54:42,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722592297] [2022-03-18 23:54:42,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:54:42,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996041701] [2022-03-18 23:54:42,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996041701] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:54:42,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:54:42,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-03-18 23:54:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067131491] [2022-03-18 23:54:42,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:54:42,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-18 23:54:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:54:42,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-18 23:54:42,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-18 23:54:42,151 INFO L87 Difference]: Start difference. First operand 2949 states and 4028 transitions. Second operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-18 23:54:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:54:43,750 INFO L93 Difference]: Finished difference Result 6529 states and 9288 transitions. [2022-03-18 23:54:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-18 23:54:43,751 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-03-18 23:54:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:54:43,765 INFO L225 Difference]: With dead ends: 6529 [2022-03-18 23:54:43,765 INFO L226 Difference]: Without dead ends: 5495 [2022-03-18 23:54:43,768 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=585, Invalid=1055, Unknown=0, NotChecked=0, Total=1640 [2022-03-18 23:54:43,768 INFO L912 BasicCegarLoop]: 113 mSDtfsCounter, 518 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 23:54:43,768 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 747 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 23:54:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2022-03-18 23:54:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5193. [2022-03-18 23:54:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 3569 states have (on average 1.2754272905575792) internal successors, (4552), 3591 states have internal predecessors, (4552), 1317 states have call successors, (1317), 308 states have call predecessors, (1317), 306 states have return successors, (1315), 1293 states have call predecessors, (1315), 1315 states have call successors, (1315) [2022-03-18 23:54:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7184 transitions. [2022-03-18 23:54:44,905 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7184 transitions. Word has length 98 [2022-03-18 23:54:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:54:44,912 INFO L478 AbstractCegarLoop]: Abstraction has 5193 states and 7184 transitions. [2022-03-18 23:54:44,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-18 23:54:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7184 transitions. [2022-03-18 23:54:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-03-18 23:54:44,918 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:54:44,918 INFO L500 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-03-18 23:54:44,936 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-03-18 23:54:45,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:54:45,134 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:54:45,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:54:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2067527905, now seen corresponding path program 2 times [2022-03-18 23:54:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:54:45,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414991450] [2022-03-18 23:54:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:54:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:54:45,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:54:45,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882844348] [2022-03-18 23:54:45,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:54:45,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:54:45,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:54:45,155 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-03-18 23:54:45,156 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-03-18 23:54:45,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:54:45,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:54:45,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-18 23:54:45,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:54:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 93 proven. 46 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-03-18 23:54:46,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:54:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-03-18 23:54:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:54:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414991450] [2022-03-18 23:54:47,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:54:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882844348] [2022-03-18 23:54:47,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882844348] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:54:47,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:54:47,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-03-18 23:54:47,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308254833] [2022-03-18 23:54:47,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:54:47,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-18 23:54:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:54:47,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-18 23:54:47,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-03-18 23:54:47,743 INFO L87 Difference]: Start difference. First operand 5193 states and 7184 transitions. Second operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-18 23:54:54,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:54:57,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-18 23:54:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:54:58,633 INFO L93 Difference]: Finished difference Result 6197 states and 8558 transitions. [2022-03-18 23:54:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-18 23:54:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-03-18 23:54:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:54:58,645 INFO L225 Difference]: With dead ends: 6197 [2022-03-18 23:54:58,645 INFO L226 Difference]: Without dead ends: 6191 [2022-03-18 23:54:58,647 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-03-18 23:54:58,647 INFO L912 BasicCegarLoop]: 77 mSDtfsCounter, 222 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 404 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-03-18 23:54:58,647 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 792 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1177 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-03-18 23:54:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2022-03-18 23:54:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5573. [2022-03-18 23:54:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 3768 states have (on average 1.28343949044586) internal successors, (4836), 3790 states have internal predecessors, (4836), 1473 states have call successors, (1473), 333 states have call predecessors, (1473), 331 states have return successors, (1471), 1449 states have call predecessors, (1471), 1471 states have call successors, (1471) [2022-03-18 23:54:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 7780 transitions. [2022-03-18 23:54:59,909 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 7780 transitions. Word has length 108 [2022-03-18 23:54:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:54:59,909 INFO L478 AbstractCegarLoop]: Abstraction has 5573 states and 7780 transitions. [2022-03-18 23:54:59,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-18 23:54:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 7780 transitions. [2022-03-18 23:54:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-18 23:54:59,911 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:54:59,911 INFO L500 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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] [2022-03-18 23:54:59,931 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-03-18 23:55:00,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-18 23:55:00,127 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:55:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:55:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash -55503749, now seen corresponding path program 1 times [2022-03-18 23:55:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:55:00,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244654666] [2022-03-18 23:55:00,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:55:00,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:55:00,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725379699] [2022-03-18 23:55:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:00,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:55:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:55:00,138 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-03-18 23:55:00,139 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-03-18 23:55:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:55:00,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-18 23:55:00,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:55:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 116 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-18 23:55:00,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:55:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-03-18 23:55:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:55:00,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244654666] [2022-03-18 23:55:00,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:55:00,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725379699] [2022-03-18 23:55:00,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725379699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:55:00,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:55:00,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-03-18 23:55:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702592693] [2022-03-18 23:55:00,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:55:00,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-18 23:55:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:55:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-18 23:55:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-03-18 23:55:00,727 INFO L87 Difference]: Start difference. First operand 5573 states and 7780 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-18 23:55:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:55:02,769 INFO L93 Difference]: Finished difference Result 9286 states and 13116 transitions. [2022-03-18 23:55:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-18 23:55:02,770 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-03-18 23:55:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:55:02,782 INFO L225 Difference]: With dead ends: 9286 [2022-03-18 23:55:02,782 INFO L226 Difference]: Without dead ends: 6132 [2022-03-18 23:55:02,787 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=708, Invalid=1272, Unknown=0, NotChecked=0, Total=1980 [2022-03-18 23:55:02,788 INFO L912 BasicCegarLoop]: 117 mSDtfsCounter, 615 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 23:55:02,788 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 591 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 23:55:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2022-03-18 23:55:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6001. [2022-03-18 23:55:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 3918 states have (on average 1.2021439509954057) internal successors, (4710), 3936 states have internal predecessors, (4710), 1705 states have call successors, (1705), 379 states have call predecessors, (1705), 377 states have return successors, (1703), 1685 states have call predecessors, (1703), 1703 states have call successors, (1703) [2022-03-18 23:55:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 8118 transitions. [2022-03-18 23:55:04,226 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 8118 transitions. Word has length 105 [2022-03-18 23:55:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:55:04,226 INFO L478 AbstractCegarLoop]: Abstraction has 6001 states and 8118 transitions. [2022-03-18 23:55:04,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-18 23:55:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 8118 transitions. [2022-03-18 23:55:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-18 23:55:04,229 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:55:04,229 INFO L500 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 5, 4, 4, 4, 4, 3, 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] [2022-03-18 23:55:04,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-18 23:55:04,446 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,SelfDestructingSolverStorable25 [2022-03-18 23:55:04,447 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:55:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:55:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1765875055, now seen corresponding path program 2 times [2022-03-18 23:55:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:55:04,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439434017] [2022-03-18 23:55:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:55:04,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:55:04,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493469184] [2022-03-18 23:55:04,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:55:04,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:55:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:55:04,458 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-03-18 23:55:04,459 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-03-18 23:55:04,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:55:04,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:55:04,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-18 23:55:04,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:55:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 311 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-03-18 23:55:04,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:55:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 119 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-03-18 23:55:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:55:05,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439434017] [2022-03-18 23:55:05,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:55:05,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493469184] [2022-03-18 23:55:05,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493469184] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:55:05,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:55:05,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-03-18 23:55:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591828541] [2022-03-18 23:55:05,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:55:05,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-18 23:55:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:55:05,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-18 23:55:05,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-03-18 23:55:05,220 INFO L87 Difference]: Start difference. First operand 6001 states and 8118 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-03-18 23:55:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:55:08,732 INFO L93 Difference]: Finished difference Result 11127 states and 15741 transitions. [2022-03-18 23:55:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-18 23:55:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2022-03-18 23:55:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:55:08,753 INFO L225 Difference]: With dead ends: 11127 [2022-03-18 23:55:08,753 INFO L226 Difference]: Without dead ends: 11122 [2022-03-18 23:55:08,756 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1327, Invalid=2333, Unknown=0, NotChecked=0, Total=3660 [2022-03-18 23:55:08,757 INFO L912 BasicCegarLoop]: 149 mSDtfsCounter, 934 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-18 23:55:08,757 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 899 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-18 23:55:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11122 states. [2022-03-18 23:55:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11122 to 10698. [2022-03-18 23:55:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10698 states, 7220 states have (on average 1.2674515235457064) internal successors, (9151), 7305 states have internal predecessors, (9151), 2921 states have call successors, (2921), 558 states have call predecessors, (2921), 556 states have return successors, (2919), 2834 states have call predecessors, (2919), 2919 states have call successors, (2919) [2022-03-18 23:55:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10698 states to 10698 states and 14991 transitions. [2022-03-18 23:55:11,448 INFO L78 Accepts]: Start accepts. Automaton has 10698 states and 14991 transitions. Word has length 132 [2022-03-18 23:55:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:55:11,449 INFO L478 AbstractCegarLoop]: Abstraction has 10698 states and 14991 transitions. [2022-03-18 23:55:11,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-03-18 23:55:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 10698 states and 14991 transitions. [2022-03-18 23:55:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-03-18 23:55:11,456 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:55:11,456 INFO L500 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:55:11,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-18 23:55:11,671 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,SelfDestructingSolverStorable26 [2022-03-18 23:55:11,671 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:55:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:55:11,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1872087437, now seen corresponding path program 1 times [2022-03-18 23:55:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:55:11,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926133288] [2022-03-18 23:55:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:11,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:55:11,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:55:11,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216964694] [2022-03-18 23:55:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:11,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:55:11,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:55:11,681 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-03-18 23:55:11,682 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-03-18 23:55:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:55:11,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-18 23:55:11,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:55:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 897 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-03-18 23:55:12,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:55:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 257 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-03-18 23:55:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:55:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926133288] [2022-03-18 23:55:12,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:55:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216964694] [2022-03-18 23:55:12,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216964694] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:55:12,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:55:12,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-03-18 23:55:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409982164] [2022-03-18 23:55:12,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:55:12,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-18 23:55:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:55:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-18 23:55:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-03-18 23:55:12,810 INFO L87 Difference]: Start difference. First operand 10698 states and 14991 transitions. Second operand has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-18 23:55:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:55:18,293 INFO L93 Difference]: Finished difference Result 18017 states and 25879 transitions. [2022-03-18 23:55:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-18 23:55:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 196 [2022-03-18 23:55:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:55:18,372 INFO L225 Difference]: With dead ends: 18017 [2022-03-18 23:55:18,372 INFO L226 Difference]: Without dead ends: 15306 [2022-03-18 23:55:18,382 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2609, Invalid=4531, Unknown=0, NotChecked=0, Total=7140 [2022-03-18 23:55:18,382 INFO L912 BasicCegarLoop]: 197 mSDtfsCounter, 1673 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-18 23:55:18,382 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1673 Valid, 1347 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-18 23:55:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15306 states. [2022-03-18 23:55:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15306 to 14953. [2022-03-18 23:55:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14953 states, 9776 states have (on average 1.2580810147299508) internal successors, (12299), 9831 states have internal predecessors, (12299), 4339 states have call successors, (4339), 839 states have call predecessors, (4339), 837 states have return successors, (4337), 4282 states have call predecessors, (4337), 4337 states have call successors, (4337) [2022-03-18 23:55:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14953 states to 14953 states and 20975 transitions. [2022-03-18 23:55:22,238 INFO L78 Accepts]: Start accepts. Automaton has 14953 states and 20975 transitions. Word has length 196 [2022-03-18 23:55:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:55:22,238 INFO L478 AbstractCegarLoop]: Abstraction has 14953 states and 20975 transitions. [2022-03-18 23:55:22,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-18 23:55:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14953 states and 20975 transitions. [2022-03-18 23:55:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-03-18 23:55:22,248 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:55:22,248 INFO L500 BasicCegarLoop]: trace histogram [21, 20, 20, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:55:22,265 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-03-18 23:55:22,463 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,SelfDestructingSolverStorable27 [2022-03-18 23:55:22,463 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:55:22,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:55:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2139737637, now seen corresponding path program 2 times [2022-03-18 23:55:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:55:22,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081534551] [2022-03-18 23:55:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:55:22,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:55:22,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486899688] [2022-03-18 23:55:22,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:55:22,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:55:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:55:22,474 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:55:22,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-18 23:55:22,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:55:22,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:55:22,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-18 23:55:22,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:55:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 950 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-03-18 23:55:23,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:55:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 310 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-03-18 23:55:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:55:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081534551] [2022-03-18 23:55:23,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:55:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486899688] [2022-03-18 23:55:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486899688] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:55:23,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:55:23,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-03-18 23:55:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780855118] [2022-03-18 23:55:23,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:55:23,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-18 23:55:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:55:23,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-18 23:55:23,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-03-18 23:55:23,850 INFO L87 Difference]: Start difference. First operand 14953 states and 20975 transitions. Second operand has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-18 23:55:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:55:29,803 INFO L93 Difference]: Finished difference Result 22942 states and 32447 transitions. [2022-03-18 23:55:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-18 23:55:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 207 [2022-03-18 23:55:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:55:29,881 INFO L225 Difference]: With dead ends: 22942 [2022-03-18 23:55:29,882 INFO L226 Difference]: Without dead ends: 15900 [2022-03-18 23:55:29,901 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3132, Invalid=5424, Unknown=0, NotChecked=0, Total=8556 [2022-03-18 23:55:29,904 INFO L912 BasicCegarLoop]: 215 mSDtfsCounter, 1689 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-18 23:55:29,904 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1689 Valid, 1379 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-18 23:55:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15900 states. [2022-03-18 23:55:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15900 to 15657. [2022-03-18 23:55:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15657 states, 9902 states have (on average 1.188547768127651) internal successors, (11769), 9944 states have internal predecessors, (11769), 4825 states have call successors, (4825), 931 states have call predecessors, (4825), 929 states have return successors, (4823), 4781 states have call predecessors, (4823), 4823 states have call successors, (4823) [2022-03-18 23:55:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15657 states to 15657 states and 21417 transitions. [2022-03-18 23:55:33,994 INFO L78 Accepts]: Start accepts. Automaton has 15657 states and 21417 transitions. Word has length 207 [2022-03-18 23:55:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:55:33,994 INFO L478 AbstractCegarLoop]: Abstraction has 15657 states and 21417 transitions. [2022-03-18 23:55:33,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-18 23:55:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15657 states and 21417 transitions. [2022-03-18 23:55:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-03-18 23:55:34,009 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:55:34,009 INFO L500 BasicCegarLoop]: trace histogram [29, 28, 28, 15, 15, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:55:34,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-18 23:55:34,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-18 23:55:34,226 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:55:34,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:55:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -777184055, now seen corresponding path program 3 times [2022-03-18 23:55:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:55:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805854618] [2022-03-18 23:55:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:55:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:55:34,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:55:34,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229696362] [2022-03-18 23:55:34,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 23:55:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:55:34,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:55:34,236 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:55:34,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-18 23:56:12,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-03-18 23:56:12,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:56:12,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-18 23:56:12,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:56:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 1955 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-03-18 23:56:12,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:56:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 611 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2022-03-18 23:56:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:56:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805854618] [2022-03-18 23:56:14,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:56:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229696362] [2022-03-18 23:56:14,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229696362] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:56:14,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:56:14,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-03-18 23:56:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747538140] [2022-03-18 23:56:14,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:56:14,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-18 23:56:14,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:56:14,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-18 23:56:14,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2022-03-18 23:56:14,174 INFO L87 Difference]: Start difference. First operand 15657 states and 21417 transitions. Second operand has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) [2022-03-18 23:56:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:56:24,286 INFO L93 Difference]: Finished difference Result 28246 states and 40383 transitions. [2022-03-18 23:56:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-03-18 23:56:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) Word has length 268 [2022-03-18 23:56:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:56:24,347 INFO L225 Difference]: With dead ends: 28246 [2022-03-18 23:56:24,348 INFO L226 Difference]: Without dead ends: 28241 [2022-03-18 23:56:24,358 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5711, Invalid=9789, Unknown=0, NotChecked=0, Total=15500 [2022-03-18 23:56:24,358 INFO L912 BasicCegarLoop]: 282 mSDtfsCounter, 2508 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 1803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 3598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1803 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-18 23:56:24,358 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [2508 Valid, 1564 Invalid, 3598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1803 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-18 23:56:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28241 states. [2022-03-18 23:56:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28241 to 26895. [2022-03-18 23:56:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26895 states, 18081 states have (on average 1.2632044687793818) internal successors, (22840), 18208 states have internal predecessors, (22840), 7539 states have call successors, (7539), 1276 states have call predecessors, (7539), 1274 states have return successors, (7537), 7410 states have call predecessors, (7537), 7537 states have call successors, (7537) [2022-03-18 23:56:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26895 states to 26895 states and 37916 transitions. [2022-03-18 23:56:31,322 INFO L78 Accepts]: Start accepts. Automaton has 26895 states and 37916 transitions. Word has length 268 [2022-03-18 23:56:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:56:31,322 INFO L478 AbstractCegarLoop]: Abstraction has 26895 states and 37916 transitions. [2022-03-18 23:56:31,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) [2022-03-18 23:56:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 26895 states and 37916 transitions. [2022-03-18 23:56:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-03-18 23:56:31,347 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:56:31,347 INFO L500 BasicCegarLoop]: trace histogram [41, 40, 40, 22, 21, 13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:56:31,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-18 23:56:31,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:56:31,557 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:56:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:56:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2114344233, now seen corresponding path program 2 times [2022-03-18 23:56:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:56:31,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918389381] [2022-03-18 23:56:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:56:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:56:31,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:56:31,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130747504] [2022-03-18 23:56:31,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:56:31,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:56:31,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:56:31,645 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:56:31,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-18 23:56:31,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:56:31,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:56:31,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-18 23:56:31,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:56:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 4165 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-18 23:56:32,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:56:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 1285 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2022-03-18 23:56:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:56:35,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918389381] [2022-03-18 23:56:35,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:56:35,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130747504] [2022-03-18 23:56:35,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130747504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:56:35,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:56:35,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2022-03-18 23:56:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812743971] [2022-03-18 23:56:35,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:56:35,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-03-18 23:56:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:56:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-03-18 23:56:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4010, Invalid=4362, Unknown=0, NotChecked=0, Total=8372 [2022-03-18 23:56:35,189 INFO L87 Difference]: Start difference. First operand 26895 states and 37916 transitions. Second operand has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) [2022-03-18 23:56:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:56:50,978 INFO L93 Difference]: Finished difference Result 42842 states and 61648 transitions. [2022-03-18 23:56:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-03-18 23:56:50,979 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) Word has length 377 [2022-03-18 23:56:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:56:51,057 INFO L225 Difference]: With dead ends: 42842 [2022-03-18 23:56:51,057 INFO L226 Difference]: Without dead ends: 35208 [2022-03-18 23:56:51,080 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=11533, Invalid=19619, Unknown=0, NotChecked=0, Total=31152 [2022-03-18 23:56:51,081 INFO L912 BasicCegarLoop]: 381 mSDtfsCounter, 3861 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 2622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3861 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 5435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2622 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-18 23:56:51,081 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [3861 Valid, 2705 Invalid, 5435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2622 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-18 23:56:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35208 states. [2022-03-18 23:57:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35208 to 34673. [2022-03-18 23:57:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34673 states, 22414 states have (on average 1.2488177032212011) internal successors, (27991), 22537 states have internal predecessors, (27991), 10363 states have call successors, (10363), 1897 states have call predecessors, (10363), 1895 states have return successors, (10361), 10238 states have call predecessors, (10361), 10361 states have call successors, (10361) [2022-03-18 23:57:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34673 states to 34673 states and 48715 transitions. [2022-03-18 23:57:00,455 INFO L78 Accepts]: Start accepts. Automaton has 34673 states and 48715 transitions. Word has length 377 [2022-03-18 23:57:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:57:00,456 INFO L478 AbstractCegarLoop]: Abstraction has 34673 states and 48715 transitions. [2022-03-18 23:57:00,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) [2022-03-18 23:57:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34673 states and 48715 transitions. [2022-03-18 23:57:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2022-03-18 23:57:00,478 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:57:00,479 INFO L500 BasicCegarLoop]: trace histogram [45, 44, 44, 24, 24, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:57:00,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-18 23:57:00,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-18 23:57:00,695 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:57:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:57:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2036089593, now seen corresponding path program 3 times [2022-03-18 23:57:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:57:00,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629576688] [2022-03-18 23:57:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:57:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:57:00,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:57:00,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691213967] [2022-03-18 23:57:00,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 23:57:00,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:57:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:57:00,706 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:57:00,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-18 23:57:00,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-18 23:57:00,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:57:00,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 23:57:00,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:57:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5477 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-03-18 23:57:01,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-18 23:57:01,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:57:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629576688] [2022-03-18 23:57:01,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:57:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691213967] [2022-03-18 23:57:01,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691213967] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 23:57:01,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 23:57:01,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 23:57:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707357890] [2022-03-18 23:57:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 23:57:01,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 23:57:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:57:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 23:57:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-18 23:57:01,143 INFO L87 Difference]: Start difference. First operand 34673 states and 48715 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-18 23:57:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:57:12,816 INFO L93 Difference]: Finished difference Result 52937 states and 74201 transitions. [2022-03-18 23:57:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 23:57:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 411 [2022-03-18 23:57:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:57:12,935 INFO L225 Difference]: With dead ends: 52937 [2022-03-18 23:57:12,935 INFO L226 Difference]: Without dead ends: 45220 [2022-03-18 23:57:12,959 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-18 23:57:12,960 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 23:57:12,960 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 247 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 23:57:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45220 states. [2022-03-18 23:57:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45220 to 39818. [2022-03-18 23:57:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39818 states, 24787 states have (on average 1.2477508371323678) internal successors, (30928), 24907 states have internal predecessors, (30928), 12577 states have call successors, (12577), 2455 states have call predecessors, (12577), 2453 states have return successors, (12575), 12455 states have call predecessors, (12575), 12575 states have call successors, (12575) [2022-03-18 23:57:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39818 states to 39818 states and 56080 transitions. [2022-03-18 23:57:23,832 INFO L78 Accepts]: Start accepts. Automaton has 39818 states and 56080 transitions. Word has length 411 [2022-03-18 23:57:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:57:23,833 INFO L478 AbstractCegarLoop]: Abstraction has 39818 states and 56080 transitions. [2022-03-18 23:57:23,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-18 23:57:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39818 states and 56080 transitions. [2022-03-18 23:57:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2022-03-18 23:57:23,856 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:57:23,856 INFO L500 BasicCegarLoop]: trace histogram [45, 44, 44, 31, 31, 19, 19, 19, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:57:23,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-18 23:57:24,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:57:24,072 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:57:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:57:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -775482707, now seen corresponding path program 1 times [2022-03-18 23:57:24,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:57:24,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583612358] [2022-03-18 23:57:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:57:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:57:24,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:57:24,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452889819] [2022-03-18 23:57:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:57:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:57:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:57:24,084 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:57:24,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-18 23:57:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 23:57:24,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 97 conjunts are in the unsatisfiable core [2022-03-18 23:57:24,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:57:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6347 backedges. 931 proven. 4994 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-03-18 23:57:25,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:57:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6347 backedges. 931 proven. 1474 refuted. 0 times theorem prover too weak. 3942 trivial. 0 not checked. [2022-03-18 23:57:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:57:27,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583612358] [2022-03-18 23:57:27,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:57:27,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452889819] [2022-03-18 23:57:27,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452889819] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:57:27,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:57:27,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-03-18 23:57:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209594141] [2022-03-18 23:57:27,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:57:27,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-18 23:57:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:57:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-18 23:57:27,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-03-18 23:57:27,598 INFO L87 Difference]: Start difference. First operand 39818 states and 56080 transitions. Second operand has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) [2022-03-18 23:57:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:57:44,298 INFO L93 Difference]: Finished difference Result 43180 states and 60942 transitions. [2022-03-18 23:57:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-03-18 23:57:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) Word has length 452 [2022-03-18 23:57:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:57:44,371 INFO L225 Difference]: With dead ends: 43180 [2022-03-18 23:57:44,371 INFO L226 Difference]: Without dead ends: 35564 [2022-03-18 23:57:44,392 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6259 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=13164, Invalid=22368, Unknown=0, NotChecked=0, Total=35532 [2022-03-18 23:57:44,392 INFO L912 BasicCegarLoop]: 405 mSDtfsCounter, 4561 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 3469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 5823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3469 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-18 23:57:44,392 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [4561 Valid, 2644 Invalid, 5823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3469 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-18 23:57:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35564 states. [2022-03-18 23:57:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35564 to 35191. [2022-03-18 23:57:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35191 states, 21996 states have (on average 1.182942353155119) internal successors, (26020), 22083 states have internal predecessors, (26020), 11147 states have call successors, (11147), 2049 states have call predecessors, (11147), 2047 states have return successors, (11145), 11058 states have call predecessors, (11145), 11145 states have call successors, (11145) [2022-03-18 23:57:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35191 states to 35191 states and 48312 transitions. [2022-03-18 23:57:53,953 INFO L78 Accepts]: Start accepts. Automaton has 35191 states and 48312 transitions. Word has length 452 [2022-03-18 23:57:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:57:53,954 INFO L478 AbstractCegarLoop]: Abstraction has 35191 states and 48312 transitions. [2022-03-18 23:57:53,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) [2022-03-18 23:57:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 35191 states and 48312 transitions. [2022-03-18 23:57:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2022-03-18 23:57:53,979 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:57:53,980 INFO L500 BasicCegarLoop]: trace histogram [61, 60, 60, 31, 31, 17, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:57:53,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-18 23:57:54,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:57:54,197 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:57:54,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:57:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash -452335303, now seen corresponding path program 4 times [2022-03-18 23:57:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:57:54,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473111257] [2022-03-18 23:57:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:57:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:57:54,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:57:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098495446] [2022-03-18 23:57:54,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 23:57:54,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:57:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:57:54,209 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:57:54,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-18 23:58:00,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 23:58:00,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:58:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 129 conjunts are in the unsatisfiable core [2022-03-18 23:58:00,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:58:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 120 proven. 9467 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-03-18 23:58:02,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:58:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 120 proven. 2747 refuted. 0 times theorem prover too weak. 7084 trivial. 0 not checked. [2022-03-18 23:58:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:58:04,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473111257] [2022-03-18 23:58:04,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:58:04,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098495446] [2022-03-18 23:58:04,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098495446] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:58:04,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:58:04,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 104 [2022-03-18 23:58:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851631856] [2022-03-18 23:58:04,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:58:04,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-18 23:58:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:58:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-18 23:58:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-03-18 23:58:04,595 INFO L87 Difference]: Start difference. First operand 35191 states and 48312 transitions. Second operand has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) [2022-03-18 23:58:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:58:22,944 INFO L93 Difference]: Finished difference Result 40003 states and 55420 transitions. [2022-03-18 23:58:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-18 23:58:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) Word has length 540 [2022-03-18 23:58:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:58:23,039 INFO L225 Difference]: With dead ends: 40003 [2022-03-18 23:58:23,039 INFO L226 Difference]: Without dead ends: 39978 [2022-03-18 23:58:23,051 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=14920, Invalid=25280, Unknown=0, NotChecked=0, Total=40200 [2022-03-18 23:58:23,052 INFO L912 BasicCegarLoop]: 429 mSDtfsCounter, 4202 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 3297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 6042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3297 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-18 23:58:23,052 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [4202 Valid, 2301 Invalid, 6042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3297 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-18 23:58:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39978 states. [2022-03-18 23:58:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39978 to 39293. [2022-03-18 23:58:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39293 states, 24853 states have (on average 1.191083571399831) internal successors, (29602), 25001 states have internal predecessors, (29602), 12233 states have call successors, (12233), 2208 states have call predecessors, (12233), 2206 states have return successors, (12231), 12083 states have call predecessors, (12231), 12231 states have call successors, (12231) [2022-03-18 23:58:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39293 states to 39293 states and 54066 transitions. [2022-03-18 23:58:34,112 INFO L78 Accepts]: Start accepts. Automaton has 39293 states and 54066 transitions. Word has length 540 [2022-03-18 23:58:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:58:34,121 INFO L478 AbstractCegarLoop]: Abstraction has 39293 states and 54066 transitions. [2022-03-18 23:58:34,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) [2022-03-18 23:58:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39293 states and 54066 transitions. [2022-03-18 23:58:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2022-03-18 23:58:34,164 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:58:34,164 INFO L500 BasicCegarLoop]: trace histogram [89, 88, 88, 44, 43, 24, 24, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:58:34,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-18 23:58:34,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-18 23:58:34,372 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:58:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:58:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1290306337, now seen corresponding path program 2 times [2022-03-18 23:58:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:58:34,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900448705] [2022-03-18 23:58:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:58:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:58:34,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:58:34,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181728425] [2022-03-18 23:58:34,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:58:34,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:58:34,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:58:34,391 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:58:34,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-18 23:58:34,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:58:34,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:58:34,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 181 conjunts are in the unsatisfiable core [2022-03-18 23:58:34,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:58:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21195 backedges. 267 proven. 20396 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-03-18 23:58:37,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:58:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21195 backedges. 267 proven. 5612 refuted. 0 times theorem prover too weak. 15316 trivial. 0 not checked. [2022-03-18 23:58:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:58:38,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900448705] [2022-03-18 23:58:38,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:58:38,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181728425] [2022-03-18 23:58:38,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181728425] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:58:38,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:58:38,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 104 [2022-03-18 23:58:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912025854] [2022-03-18 23:58:38,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:58:38,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-18 23:58:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:58:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-18 23:58:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-03-18 23:58:38,665 INFO L87 Difference]: Start difference. First operand 39293 states and 54066 transitions. Second operand has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) [2022-03-18 23:58:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:58:55,797 INFO L93 Difference]: Finished difference Result 41559 states and 57295 transitions. [2022-03-18 23:58:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-18 23:58:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) Word has length 774 [2022-03-18 23:58:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:58:55,874 INFO L225 Difference]: With dead ends: 41559 [2022-03-18 23:58:55,875 INFO L226 Difference]: Without dead ends: 38002 [2022-03-18 23:58:55,891 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 1644 GetRequests, 1444 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6047 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=14944, Invalid=25256, Unknown=0, NotChecked=0, Total=40200 [2022-03-18 23:58:55,891 INFO L912 BasicCegarLoop]: 429 mSDtfsCounter, 3592 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 2789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3592 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 5394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2789 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-18 23:58:55,891 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [3592 Valid, 2669 Invalid, 5394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2789 Valid, 2605 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-18 23:58:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2022-03-18 23:59:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 37874. [2022-03-18 23:59:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37874 states, 23599 states have (on average 1.177295648120683) internal successors, (27783), 23695 states have internal predecessors, (27783), 12049 states have call successors, (12049), 2227 states have call predecessors, (12049), 2225 states have return successors, (12047), 11951 states have call predecessors, (12047), 12047 states have call successors, (12047) [2022-03-18 23:59:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37874 states to 37874 states and 51879 transitions. [2022-03-18 23:59:06,401 INFO L78 Accepts]: Start accepts. Automaton has 37874 states and 51879 transitions. Word has length 774 [2022-03-18 23:59:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:59:06,402 INFO L478 AbstractCegarLoop]: Abstraction has 37874 states and 51879 transitions. [2022-03-18 23:59:06,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) [2022-03-18 23:59:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 37874 states and 51879 transitions. [2022-03-18 23:59:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2022-03-18 23:59:06,485 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:59:06,485 INFO L500 BasicCegarLoop]: trace histogram [93, 92, 92, 50, 50, 26, 26, 26, 25, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:59:06,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-18 23:59:06,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-18 23:59:06,704 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:59:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:59:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2079114935, now seen corresponding path program 2 times [2022-03-18 23:59:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:59:06,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320706634] [2022-03-18 23:59:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:59:06,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:59:06,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:59:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734914134] [2022-03-18 23:59:06,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 23:59:06,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:59:06,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:59:06,719 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:59:06,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-18 23:59:06,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 23:59:06,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 23:59:06,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 2164 conjuncts, 193 conjunts are in the unsatisfiable core [2022-03-18 23:59:06,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 23:59:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 23999 backedges. 843 proven. 22586 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-03-18 23:59:10,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 23:59:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 23999 backedges. 843 proven. 6394 refuted. 0 times theorem prover too weak. 16762 trivial. 0 not checked. [2022-03-18 23:59:11,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 23:59:11,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320706634] [2022-03-18 23:59:11,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-18 23:59:11,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734914134] [2022-03-18 23:59:11,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734914134] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 23:59:11,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-18 23:59:11,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 104 [2022-03-18 23:59:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722158687] [2022-03-18 23:59:11,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-18 23:59:11,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-18 23:59:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 23:59:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-18 23:59:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-03-18 23:59:11,866 INFO L87 Difference]: Start difference. First operand 37874 states and 51879 transitions. Second operand has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) [2022-03-18 23:59:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 23:59:30,033 INFO L93 Difference]: Finished difference Result 38186 states and 52313 transitions. [2022-03-18 23:59:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-18 23:59:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) Word has length 830 [2022-03-18 23:59:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 23:59:30,106 INFO L225 Difference]: With dead ends: 38186 [2022-03-18 23:59:30,106 INFO L226 Difference]: Without dead ends: 37412 [2022-03-18 23:59:30,118 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1556 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5988 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=14949, Invalid=25251, Unknown=0, NotChecked=0, Total=40200 [2022-03-18 23:59:30,118 INFO L912 BasicCegarLoop]: 429 mSDtfsCounter, 4657 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 4120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4657 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 6718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4120 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-18 23:59:30,118 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [4657 Valid, 2239 Invalid, 6718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4120 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-18 23:59:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37412 states. [2022-03-18 23:59:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37412 to 37412. [2022-03-18 23:59:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37412 states, 23323 states have (on average 1.1697894781974874) internal successors, (27283), 23416 states have internal predecessors, (27283), 11903 states have call successors, (11903), 2187 states have call predecessors, (11903), 2185 states have return successors, (11901), 11808 states have call predecessors, (11901), 11901 states have call successors, (11901) [2022-03-18 23:59:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37412 states to 37412 states and 51087 transitions. [2022-03-18 23:59:40,791 INFO L78 Accepts]: Start accepts. Automaton has 37412 states and 51087 transitions. Word has length 830 [2022-03-18 23:59:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 23:59:40,792 INFO L478 AbstractCegarLoop]: Abstraction has 37412 states and 51087 transitions. [2022-03-18 23:59:40,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) [2022-03-18 23:59:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 37412 states and 51087 transitions. [2022-03-18 23:59:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2022-03-18 23:59:40,836 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 23:59:40,836 INFO L500 BasicCegarLoop]: trace histogram [97, 96, 96, 51, 50, 27, 26, 26, 26, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 23:59:40,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-18 23:59:41,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-18 23:59:41,044 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 23:59:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 23:59:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1039841869, now seen corresponding path program 1 times [2022-03-18 23:59:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 23:59:41,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988970642] [2022-03-18 23:59:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:59:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 23:59:41,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-18 23:59:41,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576863736] [2022-03-18 23:59:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 23:59:41,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 23:59:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 23:59:41,063 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 23:59:41,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-18 23:59:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-18 23:59:47,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-19 00:00:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-19 00:00:04,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-19 00:00:04,092 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-19 00:00:04,093 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 00:00:04,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-19 00:00:04,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 00:00:04,298 INFO L718 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 00:00:04,314 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 00:00:04,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 12:00:04 BasicIcfg [2022-03-19 00:00:04,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 00:00:04,469 INFO L158 Benchmark]: Toolchain (without parser) took 442990.51ms. Allocated memory was 182.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 131.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-03-19 00:00:04,469 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 146.9MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 00:00:04,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.86ms. Allocated memory was 182.5MB in the beginning and 256.9MB in the end (delta: 74.4MB). Free memory was 130.9MB in the beginning and 234.6MB in the end (delta: -103.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-19 00:00:04,471 INFO L158 Benchmark]: Boogie Preprocessor took 21.27ms. Allocated memory is still 256.9MB. Free memory was 234.6MB in the beginning and 233.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 00:00:04,471 INFO L158 Benchmark]: RCFGBuilder took 274.24ms. Allocated memory is still 256.9MB. Free memory was 233.0MB in the beginning and 220.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-19 00:00:04,471 INFO L158 Benchmark]: IcfgTransformer took 41.57ms. Allocated memory is still 256.9MB. Free memory was 220.9MB in the beginning and 219.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 00:00:04,471 INFO L158 Benchmark]: TraceAbstraction took 442429.34ms. Allocated memory was 256.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 219.3MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-03-19 00:00:04,472 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 146.9MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.86ms. Allocated memory was 182.5MB in the beginning and 256.9MB in the end (delta: 74.4MB). Free memory was 130.9MB in the beginning and 234.6MB in the end (delta: -103.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.27ms. Allocated memory is still 256.9MB. Free memory was 234.6MB in the beginning and 233.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.24ms. Allocated memory is still 256.9MB. Free memory was 233.0MB in the beginning and 220.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 41.57ms. Allocated memory is still 256.9MB. Free memory was 220.9MB in the beginning and 219.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 442429.34ms. Allocated memory was 256.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 219.3MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.9GB. 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)=104, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [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=121393, y=196418] [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=121393, y=196418] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=121393, b=196418, counter=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=121393, b=196418, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=1, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=2, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=196418, b=121393, c=121393, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=121393, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=121393, b=75025, c=75025, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=75025, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=75025, b=46368, c=46368, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=46368, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=12, counter++=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, counter++=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=14, counter++=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=14, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=46368, b=28657, c=28657, counter=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=28657, counter=15, counter++=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=16, counter++=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, counter++=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=18, counter++=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=18, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=28657, b=17711, c=17711, counter=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=17711, counter=19, counter++=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=20, counter++=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, counter++=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=22, counter++=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=22, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=17711, b=10946, c=10946, counter=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=10946, counter=23, counter++=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=24, counter++=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, counter++=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=26, counter++=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=26, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=10946, b=6765, c=6765, counter=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=6765, counter=27, counter++=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=28, counter++=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, counter++=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=30, counter++=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=30, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=6765, b=4181, c=4181, counter=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=4181, counter=31, counter++=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=32, counter++=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, counter++=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=34, counter++=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=34, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=35, counter++=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=36, counter++=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, counter++=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=38, counter++=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=38, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=39, counter++=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=40, counter++=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, counter++=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=42, counter++=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=42, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=1597, b=987, c=987, counter=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=987, counter=43, counter++=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=44, counter++=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, counter++=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=1597, b=987, c=610, counter=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=610, counter=46, counter++=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=46, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=987, b=610, c=610, counter=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=610, counter=47, counter++=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=987, b=610, c=987, counter=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=48, counter++=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=987, b=610, c=987, counter=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, counter++=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] 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] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L50] 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] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L51] 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] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=987, b=610, c=377, counter=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=377, counter=50, counter++=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=987, b=610, c=377, counter=50, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=610, b=377, c=377, counter=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=51, counter++=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=610, b=377, c=610, counter=51, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=52, counter++=51, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=610, b=377, c=610, counter=52, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, counter++=52, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=610, b=377, c=233, counter=53, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=54, counter++=53, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=54, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=377, b=233, c=233, counter=54, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=55, counter++=54, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=377, b=233, c=377, counter=55, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=56, counter++=55, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=377, b=233, c=377, counter=56, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, counter++=56, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=377, b=233, c=144, counter=57, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=58, counter++=57, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=58, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=233, b=144, c=144, counter=58, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=59, counter++=58, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=233, b=144, c=233, counter=59, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=60, counter++=59, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=233, b=144, c=233, counter=60, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, counter++=60, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=233, b=144, c=89, counter=61, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=62, counter++=61, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=62, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=144, b=89, c=89, counter=62, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=63, counter++=62, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=144, b=89, c=144, counter=63, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=64, counter++=63, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=144, b=89, c=144, counter=64, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, counter++=64, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=144, b=89, c=55, counter=65, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=66, counter++=65, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=66, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=89, b=55, c=55, counter=66, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=67, counter++=66, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=89, b=55, c=89, counter=67, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=68, counter++=67, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=89, b=55, c=89, counter=68, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, counter++=68, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=89, b=55, c=34, counter=69, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=70, counter++=69, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=70, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=70, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=71, counter++=70, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=71, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=72, counter++=71, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=55, b=34, c=55, counter=72, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, counter++=72, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=55, b=34, c=21, counter=73, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=74, counter++=73, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=74, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=74, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=75, counter++=74, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=75, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=76, counter++=75, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=34, b=21, c=34, counter=76, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, counter++=76, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=34, b=21, c=13, counter=77, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=78, counter++=77, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=78, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=78, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=79, counter++=78, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=79, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=80, counter++=79, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=21, b=13, c=21, counter=80, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, counter++=80, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=21, b=13, c=8, counter=81, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=82, counter++=81, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=82, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=82, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=83, counter++=82, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=83, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=84, counter++=83, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=13, b=8, c=13, counter=84, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, counter++=84, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=13, b=8, c=5, counter=85, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=86, counter++=85, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=86, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=86, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=87, counter++=86, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=87, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=88, counter++=87, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=8, b=5, c=8, counter=88, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, counter++=88, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=8, b=5, c=3, counter=89, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=90, counter++=89, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=90, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=90, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=91, counter++=90, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=91, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=92, counter++=91, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=5, b=3, c=5, counter=92, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, counter++=92, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=93, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=94, counter++=93, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=94, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=94, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=95, counter++=94, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=95, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=96, counter++=95, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=96, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, counter++=96, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=97, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=98, counter++=97, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=98, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=98, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=99, counter++=98, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2, b=1, c=2, counter=99, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=2, counter=100, counter++=99, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=2, b=1, c=2, counter=100, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=2, counter=101, counter++=100, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L48] COND FALSE !(counter++<100) [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=2, b=1, c=1, counter=101, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=102, counter++=101, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L41] COND FALSE !(counter++<100) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=1, b=1, c=1, counter=102, d=1, k=1, p=75025, q=-121393, r=-46368, s=75025, temp=28657, v=1, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=103, counter++=102, d=1, k=1, p=75025, q=-121393, r=-46368, s=75025, temp=28657, v=1, x=121393, y=196418] [L34] COND FALSE !(counter++<100) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=103] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=103] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=103] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 442.2s, OverallIterations: 37, TraceHistogramMax: 97, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 234.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 31688 SdHoareTripleChecker+Valid, 61.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31611 mSDsluCounter, 28003 SdHoareTripleChecker+Invalid, 57.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23427 mSDsCounter, 23703 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25408 IncrementalHoareTripleChecker+Invalid, 49115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23703 mSolverCounterUnsat, 4576 mSDtfsCounter, 25408 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11208 GetRequests, 9346 SyntacticMatches, 16 SemanticMatches, 1846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42164 ImplicationChecksByTransitivity, 90.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39818occurred in iteration=32, InterpolantAutomatonStates: 1796, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 86.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 12368 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 52.1s SatisfiabilityAnalysisTime, 43.0s InterpolantComputationTime, 6425 NumberOfCodeBlocks, 6003 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 10266 ConstructedInterpolants, 0 QuantifiedInterpolants, 33500 SizeOfPredicates, 569 NumberOfNonLiveVariables, 14827 ConjunctsInSsa, 1492 ConjunctsInUnsatCore, 60 InterpolantComputations, 13 PerfectInterpolantSequences, 65048/150318 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-19 00:00:04,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...