./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash deef9b1f63fa90bdeace0bbb769d25578ef53bda95c70ad5e444555427b2b0e2 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 11:58:35,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 11:58:35,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 11:58:35,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 11:58:35,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 11:58:35,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 11:58:35,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 11:58:35,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 11:58:35,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 11:58:35,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 11:58:35,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 11:58:35,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 11:58:35,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 11:58:35,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 11:58:35,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 11:58:35,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 11:58:35,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 11:58:35,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 11:58:35,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 11:58:35,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 11:58:35,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 11:58:35,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 11:58:35,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 11:58:35,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 11:58:35,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 11:58:35,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 11:58:35,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 11:58:35,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 11:58:35,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 11:58:35,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 11:58:35,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 11:58:35,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 11:58:35,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 11:58:35,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 11:58:35,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 11:58:35,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 11:58:35,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 11:58:35,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 11:58:35,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 11:58:35,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 11:58:35,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 11:58:35,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 11:58:35,828 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 11:58:35,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 11:58:35,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 11:58:35,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 11:58:35,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 11:58:35,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 11:58:35,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 11:58:35,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 11:58:35,830 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 11:58:35,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 11:58:35,831 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 11:58:35,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 11:58:35,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 11:58:35,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 11:58:35,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 11:58:35,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 11:58:35,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 11:58:35,832 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 11:58:35,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 11:58:35,832 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 11:58:35,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 11:58:35,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 11:58:35,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 11:58:35,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 11:58:35,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 11:58:35,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 11:58:35,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 11:58:35,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 11:58:35,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 11:58:35,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 11:58:35,834 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 11:58:35,834 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 11:58:35,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 11:58:35,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 11:58:35,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deef9b1f63fa90bdeace0bbb769d25578ef53bda95c70ad5e444555427b2b0e2 [2021-12-17 11:58:36,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 11:58:36,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 11:58:36,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 11:58:36,074 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 11:58:36,075 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 11:58:36,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2021-12-17 11:58:36,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01cbf039/9a3eaa547cc74d43935162c6848c78b1/FLAG8b73e3fdf [2021-12-17 11:58:36,441 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 11:58:36,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2021-12-17 11:58:36,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01cbf039/9a3eaa547cc74d43935162c6848c78b1/FLAG8b73e3fdf [2021-12-17 11:58:36,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01cbf039/9a3eaa547cc74d43935162c6848c78b1 [2021-12-17 11:58:36,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 11:58:36,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 11:58:36,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 11:58:36,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 11:58:36,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 11:58:36,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:58:36" (1/1) ... [2021-12-17 11:58:36,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ef638e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:36, skipping insertion in model container [2021-12-17 11:58:36,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:58:36" (1/1) ... [2021-12-17 11:58:36,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 11:58:36,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 11:58:37,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound50.c[490,503] [2021-12-17 11:58:37,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 11:58:37,101 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 11:58:37,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound50.c[490,503] [2021-12-17 11:58:37,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 11:58:37,149 INFO L208 MainTranslator]: Completed translation [2021-12-17 11:58:37,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37 WrapperNode [2021-12-17 11:58:37,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 11:58:37,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 11:58:37,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 11:58:37,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 11:58:37,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,207 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 84 [2021-12-17 11:58:37,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 11:58:37,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 11:58:37,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 11:58:37,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 11:58:37,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 11:58:37,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 11:58:37,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 11:58:37,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 11:58:37,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (1/1) ... [2021-12-17 11:58:37,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 11:58:37,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:37,266 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) [2021-12-17 11:58:37,279 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 [2021-12-17 11:58:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 11:58:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 11:58:37,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 11:58:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 11:58:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 11:58:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 11:58:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 11:58:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 11:58:37,351 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 11:58:37,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 11:58:37,495 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 11:58:37,499 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 11:58:37,499 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 11:58:37,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:58:37 BoogieIcfgContainer [2021-12-17 11:58:37,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 11:58:37,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 11:58:37,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 11:58:37,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 11:58:37,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:58:36" (1/3) ... [2021-12-17 11:58:37,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36df6787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:58:37, skipping insertion in model container [2021-12-17 11:58:37,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:58:37" (2/3) ... [2021-12-17 11:58:37,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36df6787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:58:37, skipping insertion in model container [2021-12-17 11:58:37,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:58:37" (3/3) ... [2021-12-17 11:58:37,522 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound50.c [2021-12-17 11:58:37,536 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 11:58:37,536 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 11:58:37,566 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 11:58:37,570 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 11:58:37,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 11:58:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-17 11:58:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 11:58:37,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:37,584 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:37,584 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1022199732, now seen corresponding path program 1 times [2021-12-17 11:58:37,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:37,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835127899] [2021-12-17 11:58:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:37,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 11:58:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 11:58:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:37,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 11:58:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 11:58:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 11:58:37,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835127899] [2021-12-17 11:58:37,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835127899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:58:37,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:58:37,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 11:58:37,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664820672] [2021-12-17 11:58:37,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:58:37,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 11:58:37,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 11:58:37,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 11:58:37,778 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 11:58:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:37,793 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2021-12-17 11:58:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 11:58:37,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2021-12-17 11:58:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:37,800 INFO L225 Difference]: With dead ends: 65 [2021-12-17 11:58:37,800 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 11:58:37,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 11:58:37,805 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:37,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 11:58:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 11:58:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:58:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2021-12-17 11:58:37,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 28 [2021-12-17 11:58:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:37,832 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2021-12-17 11:58:37,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 11:58:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2021-12-17 11:58:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 11:58:37,834 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:37,834 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:37,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 11:58:37,835 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash -455220980, now seen corresponding path program 1 times [2021-12-17 11:58:37,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875375061] [2021-12-17 11:58:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:37,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:37,851 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:37,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440958341] [2021-12-17 11:58:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:37,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:37,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:37,864 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) [2021-12-17 11:58:37,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 11:58:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:37,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 11:58:37,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 11:58:38,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:58:38,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875375061] [2021-12-17 11:58:38,001 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:38,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440958341] [2021-12-17 11:58:38,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440958341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:58:38,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:58:38,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 11:58:38,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910446131] [2021-12-17 11:58:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:58:38,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 11:58:38,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 11:58:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 11:58:38,005 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 11:58:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:38,017 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2021-12-17 11:58:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 11:58:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2021-12-17 11:58:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:38,019 INFO L225 Difference]: With dead ends: 40 [2021-12-17 11:58:38,019 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 11:58:38,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 11:58:38,020 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 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 [2021-12-17 11:58:38,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 11:58:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-17 11:58:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:58:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2021-12-17 11:58:38,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 29 [2021-12-17 11:58:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:38,027 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-17 11:58:38,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 11:58:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2021-12-17 11:58:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 11:58:38,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:38,028 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:38,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:38,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:38,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1233535180, now seen corresponding path program 1 times [2021-12-17 11:58:38,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:38,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869375688] [2021-12-17 11:58:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:38,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:38,257 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:38,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051650301] [2021-12-17 11:58:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:38,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:38,259 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) [2021-12-17 11:58:38,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 11:58:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:38,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 11:58:38,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 11:58:38,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 11:58:38,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:38,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869375688] [2021-12-17 11:58:38,531 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:38,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051650301] [2021-12-17 11:58:38,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051650301] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:38,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:38,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-17 11:58:38,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125466002] [2021-12-17 11:58:38,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:38,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 11:58:38,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 11:58:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 11:58:38,535 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 11:58:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:38,591 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2021-12-17 11:58:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 11:58:38,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2021-12-17 11:58:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:38,593 INFO L225 Difference]: With dead ends: 49 [2021-12-17 11:58:38,593 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 11:58:38,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-17 11:58:38,594 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:38,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 111 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 11:58:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-12-17 11:58:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:58:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-17 11:58:38,600 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 30 [2021-12-17 11:58:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:38,600 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-17 11:58:38,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-17 11:58:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2021-12-17 11:58:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 11:58:38,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:38,601 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:38,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:38,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-17 11:58:38,818 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -73118621, now seen corresponding path program 1 times [2021-12-17 11:58:38,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:38,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307128231] [2021-12-17 11:58:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:38,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:38,851 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:38,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866452932] [2021-12-17 11:58:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:38,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:38,860 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) [2021-12-17 11:58:38,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 11:58:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:38,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 11:58:38,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 11:58:39,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 11:58:39,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:39,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307128231] [2021-12-17 11:58:39,089 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:39,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866452932] [2021-12-17 11:58:39,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866452932] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 11:58:39,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 11:58:39,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2021-12-17 11:58:39,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209560919] [2021-12-17 11:58:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:58:39,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:58:39,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:58:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-17 11:58:39,091 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 11:58:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:39,128 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-12-17 11:58:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:58:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2021-12-17 11:58:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:39,129 INFO L225 Difference]: With dead ends: 39 [2021-12-17 11:58:39,129 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 11:58:39,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-17 11:58:39,130 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:39,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 11:58:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-17 11:58:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:58:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2021-12-17 11:58:39,136 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 32 [2021-12-17 11:58:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:39,136 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2021-12-17 11:58:39,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 11:58:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2021-12-17 11:58:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 11:58:39,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:39,138 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:39,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 11:58:39,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:39,355 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash 96561445, now seen corresponding path program 1 times [2021-12-17 11:58:39,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:39,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967612863] [2021-12-17 11:58:39,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:39,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:39,362 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627363304] [2021-12-17 11:58:39,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:39,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:39,364 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) [2021-12-17 11:58:39,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 11:58:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:39,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 11:58:39,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 11:58:39,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:58:39,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967612863] [2021-12-17 11:58:39,489 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:39,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627363304] [2021-12-17 11:58:39,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627363304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:58:39,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:58:39,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 11:58:39,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65687156] [2021-12-17 11:58:39,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:58:39,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:58:39,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:58:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 11:58:39,491 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 11:58:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:39,518 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2021-12-17 11:58:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:58:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2021-12-17 11:58:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:39,520 INFO L225 Difference]: With dead ends: 62 [2021-12-17 11:58:39,520 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 11:58:39,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 11:58:39,521 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:39,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 11:58:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-17 11:58:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 11:58:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2021-12-17 11:58:39,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 35 [2021-12-17 11:58:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:39,526 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-17 11:58:39,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 11:58:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2021-12-17 11:58:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 11:58:39,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:39,527 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:39,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 11:58:39,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:39,757 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:39,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:39,758 INFO L85 PathProgramCache]: Analyzing trace with hash 433790877, now seen corresponding path program 1 times [2021-12-17 11:58:39,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:39,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160936468] [2021-12-17 11:58:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:39,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:39,764 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:39,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352485481] [2021-12-17 11:58:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:39,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:39,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:39,765 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) [2021-12-17 11:58:39,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 11:58:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:39,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 11:58:39,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 11:58:39,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 11:58:40,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:40,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160936468] [2021-12-17 11:58:40,117 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:40,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352485481] [2021-12-17 11:58:40,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352485481] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 11:58:40,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 11:58:40,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2021-12-17 11:58:40,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957663624] [2021-12-17 11:58:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:58:40,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:58:40,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:40,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:58:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 11:58:40,120 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:58:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:40,164 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2021-12-17 11:58:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:58:40,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2021-12-17 11:58:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:40,167 INFO L225 Difference]: With dead ends: 53 [2021-12-17 11:58:40,168 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 11:58:40,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-17 11:58:40,171 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:40,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 11:58:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-12-17 11:58:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-17 11:58:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2021-12-17 11:58:40,187 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 37 [2021-12-17 11:58:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:40,187 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2021-12-17 11:58:40,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:58:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2021-12-17 11:58:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 11:58:40,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:40,189 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:40,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:40,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:40,396 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash -553232285, now seen corresponding path program 1 times [2021-12-17 11:58:40,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:40,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261619021] [2021-12-17 11:58:40,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:40,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:40,403 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:40,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638548893] [2021-12-17 11:58:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:40,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:40,418 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) [2021-12-17 11:58:40,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 11:58:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:40,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 11:58:40,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 11:58:40,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:58:40,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:40,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261619021] [2021-12-17 11:58:40,576 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:40,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638548893] [2021-12-17 11:58:40,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638548893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:58:40,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:58:40,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 11:58:40,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082108064] [2021-12-17 11:58:40,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:58:40,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:58:40,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:58:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 11:58:40,577 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-17 11:58:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:40,608 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2021-12-17 11:58:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:58:40,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2021-12-17 11:58:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:40,609 INFO L225 Difference]: With dead ends: 57 [2021-12-17 11:58:40,609 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 11:58:40,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 11:58:40,610 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:40,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:58:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 11:58:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-12-17 11:58:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-17 11:58:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2021-12-17 11:58:40,616 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 42 [2021-12-17 11:58:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:40,616 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2021-12-17 11:58:40,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-17 11:58:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2021-12-17 11:58:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-17 11:58:40,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:40,617 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:40,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:40,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:40,834 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:40,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2115683101, now seen corresponding path program 1 times [2021-12-17 11:58:40,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:40,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331839084] [2021-12-17 11:58:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:40,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:40,841 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:40,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003065673] [2021-12-17 11:58:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:40,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:40,842 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) [2021-12-17 11:58:40,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 11:58:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:40,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 11:58:40,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-17 11:58:41,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:41,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331839084] [2021-12-17 11:58:41,206 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003065673] [2021-12-17 11:58:41,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003065673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 11:58:41,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 11:58:41,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-12-17 11:58:41,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759863771] [2021-12-17 11:58:41,207 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:41,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 11:58:41,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:41,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 11:58:41,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 11:58:41,207 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 11:58:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:41,373 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-12-17 11:58:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 11:58:41,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2021-12-17 11:58:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:41,374 INFO L225 Difference]: With dead ends: 61 [2021-12-17 11:58:41,374 INFO L226 Difference]: Without dead ends: 59 [2021-12-17 11:58:41,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-17 11:58:41,375 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:41,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 152 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:58:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-17 11:58:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-12-17 11:58:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-17 11:58:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2021-12-17 11:58:41,392 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 47 [2021-12-17 11:58:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:41,392 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2021-12-17 11:58:41,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 11:58:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2021-12-17 11:58:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 11:58:41,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:41,399 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:41,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:41,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:41,619 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -879665460, now seen corresponding path program 1 times [2021-12-17 11:58:41,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519487032] [2021-12-17 11:58:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:41,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:41,647 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:41,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453525428] [2021-12-17 11:58:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:41,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:41,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:41,654 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) [2021-12-17 11:58:41,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 11:58:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:41,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 11:58:41,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-17 11:58:41,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-17 11:58:41,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:41,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519487032] [2021-12-17 11:58:41,890 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:41,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453525428] [2021-12-17 11:58:41,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453525428] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:41,891 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:41,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-12-17 11:58:41,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658528100] [2021-12-17 11:58:41,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:41,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 11:58:41,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:41,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 11:58:41,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-17 11:58:41,895 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-17 11:58:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:42,017 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2021-12-17 11:58:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 11:58:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2021-12-17 11:58:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:42,036 INFO L225 Difference]: With dead ends: 211 [2021-12-17 11:58:42,036 INFO L226 Difference]: Without dead ends: 203 [2021-12-17 11:58:42,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-12-17 11:58:42,039 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:42,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 197 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:58:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-17 11:58:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2021-12-17 11:58:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 125 states have (on average 1.192) internal successors, (149), 129 states have internal predecessors, (149), 44 states have call successors, (44), 25 states have call predecessors, (44), 25 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2021-12-17 11:58:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 233 transitions. [2021-12-17 11:58:42,077 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 233 transitions. Word has length 56 [2021-12-17 11:58:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:42,077 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 233 transitions. [2021-12-17 11:58:42,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-17 11:58:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 233 transitions. [2021-12-17 11:58:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 11:58:42,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:42,082 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:42,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:42,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-17 11:58:42,289 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1506412172, now seen corresponding path program 1 times [2021-12-17 11:58:42,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:42,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123627579] [2021-12-17 11:58:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:42,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:42,294 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:42,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069861453] [2021-12-17 11:58:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:42,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:42,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:42,311 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) [2021-12-17 11:58:42,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 11:58:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:42,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 11:58:42,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-17 11:58:42,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-17 11:58:42,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:42,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123627579] [2021-12-17 11:58:42,547 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:42,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069861453] [2021-12-17 11:58:42,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069861453] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:42,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:42,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-12-17 11:58:42,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474344846] [2021-12-17 11:58:42,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:42,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 11:58:42,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 11:58:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-17 11:58:42,549 INFO L87 Difference]: Start difference. First operand 195 states and 233 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 11:58:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:42,709 INFO L93 Difference]: Finished difference Result 279 states and 364 transitions. [2021-12-17 11:58:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 11:58:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 57 [2021-12-17 11:58:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:42,712 INFO L225 Difference]: With dead ends: 279 [2021-12-17 11:58:42,712 INFO L226 Difference]: Without dead ends: 259 [2021-12-17 11:58:42,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-12-17 11:58:42,715 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:42,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 299 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:58:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-17 11:58:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2021-12-17 11:58:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2021-12-17 11:58:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2021-12-17 11:58:42,736 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 57 [2021-12-17 11:58:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:42,737 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2021-12-17 11:58:42,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 11:58:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2021-12-17 11:58:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-17 11:58:42,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:42,740 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:42,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:42,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 11:58:42,957 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1869160295, now seen corresponding path program 1 times [2021-12-17 11:58:42,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:42,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17092023] [2021-12-17 11:58:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:42,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:42,967 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:42,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266491001] [2021-12-17 11:58:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:42,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:42,972 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) [2021-12-17 11:58:42,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 11:58:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:43,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 11:58:43,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-17 11:58:43,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-17 11:58:43,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:43,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17092023] [2021-12-17 11:58:43,218 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:43,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266491001] [2021-12-17 11:58:43,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266491001] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:43,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:43,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-12-17 11:58:43,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027896517] [2021-12-17 11:58:43,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:43,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 11:58:43,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:43,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 11:58:43,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-17 11:58:43,220 INFO L87 Difference]: Start difference. First operand 235 states and 299 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-17 11:58:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:43,342 INFO L93 Difference]: Finished difference Result 344 states and 448 transitions. [2021-12-17 11:58:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 11:58:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 59 [2021-12-17 11:58:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:43,344 INFO L225 Difference]: With dead ends: 344 [2021-12-17 11:58:43,345 INFO L226 Difference]: Without dead ends: 248 [2021-12-17 11:58:43,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-17 11:58:43,346 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 75 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:43,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 258 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:58:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-17 11:58:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2021-12-17 11:58:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 161 states have (on average 1.173913043478261) internal successors, (189), 164 states have internal predecessors, (189), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2021-12-17 11:58:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2021-12-17 11:58:43,361 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 59 [2021-12-17 11:58:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:43,361 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2021-12-17 11:58:43,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-12-17 11:58:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2021-12-17 11:58:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-17 11:58:43,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:43,362 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:43,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:43,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 11:58:43,580 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash 991223133, now seen corresponding path program 1 times [2021-12-17 11:58:43,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:43,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725200576] [2021-12-17 11:58:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:43,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:43,591 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:43,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137242882] [2021-12-17 11:58:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:43,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:43,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:43,593 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) [2021-12-17 11:58:43,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 11:58:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:43,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 11:58:43,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-17 11:58:43,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-17 11:58:43,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:43,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725200576] [2021-12-17 11:58:43,976 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:43,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137242882] [2021-12-17 11:58:43,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137242882] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:43,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:43,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-12-17 11:58:43,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876540885] [2021-12-17 11:58:43,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:43,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 11:58:43,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:43,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 11:58:43,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-17 11:58:43,977 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-17 11:58:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:44,280 INFO L93 Difference]: Finished difference Result 330 states and 429 transitions. [2021-12-17 11:58:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 11:58:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 64 [2021-12-17 11:58:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:44,283 INFO L225 Difference]: With dead ends: 330 [2021-12-17 11:58:44,283 INFO L226 Difference]: Without dead ends: 324 [2021-12-17 11:58:44,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-17 11:58:44,284 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:44,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 318 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 11:58:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-17 11:58:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2021-12-17 11:58:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 194 states have (on average 1.1958762886597938) internal successors, (232), 203 states have internal predecessors, (232), 69 states have call successors, (69), 27 states have call predecessors, (69), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-17 11:58:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 366 transitions. [2021-12-17 11:58:44,302 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 366 transitions. Word has length 64 [2021-12-17 11:58:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:44,303 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 366 transitions. [2021-12-17 11:58:44,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-17 11:58:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 366 transitions. [2021-12-17 11:58:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 11:58:44,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:44,304 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:44,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:44,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 11:58:44,521 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:44,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1694315171, now seen corresponding path program 2 times [2021-12-17 11:58:44,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:44,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266142297] [2021-12-17 11:58:44,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:44,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:44,527 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:44,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754096599] [2021-12-17 11:58:44,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 11:58:44,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:44,529 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) [2021-12-17 11:58:44,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 11:58:44,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 11:58:44,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:58:44,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 11:58:44,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-17 11:58:44,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-17 11:58:45,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266142297] [2021-12-17 11:58:45,144 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:45,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754096599] [2021-12-17 11:58:45,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754096599] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:45,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:45,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 16 [2021-12-17 11:58:45,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075670910] [2021-12-17 11:58:45,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:45,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 11:58:45,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 11:58:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-12-17 11:58:45,146 INFO L87 Difference]: Start difference. First operand 291 states and 366 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2021-12-17 11:58:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:46,421 INFO L93 Difference]: Finished difference Result 315 states and 395 transitions. [2021-12-17 11:58:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 11:58:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) Word has length 69 [2021-12-17 11:58:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:46,422 INFO L225 Difference]: With dead ends: 315 [2021-12-17 11:58:46,422 INFO L226 Difference]: Without dead ends: 312 [2021-12-17 11:58:46,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-17 11:58:46,423 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 67 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:46,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-17 11:58:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-17 11:58:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2021-12-17 11:58:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 203 states have (on average 1.187192118226601) internal successors, (241), 211 states have internal predecessors, (241), 67 states have call successors, (67), 30 states have call predecessors, (67), 30 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2021-12-17 11:58:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 372 transitions. [2021-12-17 11:58:46,440 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 372 transitions. Word has length 69 [2021-12-17 11:58:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:46,440 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 372 transitions. [2021-12-17 11:58:46,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2021-12-17 11:58:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 372 transitions. [2021-12-17 11:58:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-17 11:58:46,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:46,441 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:46,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:46,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 11:58:46,655 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1349365539, now seen corresponding path program 3 times [2021-12-17 11:58:46,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:46,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968947190] [2021-12-17 11:58:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:46,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:46,662 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:46,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074480627] [2021-12-17 11:58:46,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 11:58:46,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:46,667 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) [2021-12-17 11:58:46,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 11:58:46,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 11:58:46,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:58:46,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-17 11:58:46,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 11:58:48,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:48,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:48,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968947190] [2021-12-17 11:58:48,221 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:48,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074480627] [2021-12-17 11:58:48,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074480627] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 11:58:48,221 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 11:58:48,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-17 11:58:48,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573792097] [2021-12-17 11:58:48,221 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:48,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 11:58:48,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 11:58:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-12-17 11:58:48,222 INFO L87 Difference]: Start difference. First operand 301 states and 372 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-17 11:58:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:49,943 INFO L93 Difference]: Finished difference Result 333 states and 407 transitions. [2021-12-17 11:58:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 11:58:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2021-12-17 11:58:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:49,945 INFO L225 Difference]: With dead ends: 333 [2021-12-17 11:58:49,945 INFO L226 Difference]: Without dead ends: 329 [2021-12-17 11:58:49,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-12-17 11:58:49,946 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:49,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 335 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-17 11:58:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-17 11:58:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2021-12-17 11:58:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 220 states have (on average 1.1772727272727272) internal successors, (259), 227 states have internal predecessors, (259), 71 states have call successors, (71), 35 states have call predecessors, (71), 34 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68) [2021-12-17 11:58:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 398 transitions. [2021-12-17 11:58:49,965 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 398 transitions. Word has length 74 [2021-12-17 11:58:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:49,965 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 398 transitions. [2021-12-17 11:58:49,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-17 11:58:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 398 transitions. [2021-12-17 11:58:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-17 11:58:49,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:49,967 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:49,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:50,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 11:58:50,184 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -484140586, now seen corresponding path program 1 times [2021-12-17 11:58:50,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:50,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451729293] [2021-12-17 11:58:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:50,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:50,190 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244952259] [2021-12-17 11:58:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:50,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:50,203 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) [2021-12-17 11:58:50,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 11:58:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:50,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 11:58:50,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-17 11:58:50,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:58:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-17 11:58:51,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:58:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451729293] [2021-12-17 11:58:51,136 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:58:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244952259] [2021-12-17 11:58:51,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244952259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:58:51,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:58:51,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2021-12-17 11:58:51,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742311289] [2021-12-17 11:58:51,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:58:51,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 11:58:51,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:58:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 11:58:51,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-12-17 11:58:51,138 INFO L87 Difference]: Start difference. First operand 326 states and 398 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 11 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2021-12-17 11:58:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:58:53,272 INFO L93 Difference]: Finished difference Result 388 states and 484 transitions. [2021-12-17 11:58:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 11:58:53,273 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 11 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) Word has length 80 [2021-12-17 11:58:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:58:53,274 INFO L225 Difference]: With dead ends: 388 [2021-12-17 11:58:53,274 INFO L226 Difference]: Without dead ends: 373 [2021-12-17 11:58:53,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2021-12-17 11:58:53,275 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 85 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-17 11:58:53,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 435 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-17 11:58:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-17 11:58:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 364. [2021-12-17 11:58:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 246 states have (on average 1.1910569105691058) internal successors, (293), 251 states have internal predecessors, (293), 82 states have call successors, (82), 35 states have call predecessors, (82), 35 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-12-17 11:58:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 456 transitions. [2021-12-17 11:58:53,319 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 456 transitions. Word has length 80 [2021-12-17 11:58:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:58:53,319 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 456 transitions. [2021-12-17 11:58:53,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 11 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2021-12-17 11:58:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 456 transitions. [2021-12-17 11:58:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-17 11:58:53,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:58:53,320 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:58:53,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 11:58:53,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:53,546 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:58:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:58:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1718599493, now seen corresponding path program 1 times [2021-12-17 11:58:53,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:58:53,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482470902] [2021-12-17 11:58:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:53,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:58:53,552 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:58:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757418893] [2021-12-17 11:58:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:58:53,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:58:53,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:58:53,555 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) [2021-12-17 11:58:53,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 11:58:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:58:53,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-17 11:58:53,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:58:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 70 proven. 73 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-17 11:58:54,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:59:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 90 proven. 38 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-12-17 11:59:17,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:59:17,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482470902] [2021-12-17 11:59:17,959 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:59:17,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757418893] [2021-12-17 11:59:17,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757418893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:59:17,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:59:17,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2021-12-17 11:59:17,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280486404] [2021-12-17 11:59:17,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:59:17,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 11:59:17,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:59:17,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 11:59:17,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2021-12-17 11:59:17,961 INFO L87 Difference]: Start difference. First operand 364 states and 456 transitions. Second operand has 27 states, 23 states have (on average 2.217391304347826) internal successors, (51), 18 states have internal predecessors, (51), 16 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2021-12-17 11:59:20,454 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 [] [2021-12-17 11:59:27,706 WARN L227 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 57 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:59:40,540 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 [] [2021-12-17 11:59:50,610 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 [] [2021-12-17 12:00:00,395 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 [] [2021-12-17 12:00:02,672 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 [] [2021-12-17 12:00:10,359 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 [] [2021-12-17 12:00:29,700 WARN L227 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 79 DAG size of output: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 12:00:32,292 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 [] [2021-12-17 12:00:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:00:32,421 INFO L93 Difference]: Finished difference Result 484 states and 634 transitions. [2021-12-17 12:00:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-17 12:00:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.217391304347826) internal successors, (51), 18 states have internal predecessors, (51), 16 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 97 [2021-12-17 12:00:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:00:32,424 INFO L225 Difference]: With dead ends: 484 [2021-12-17 12:00:32,424 INFO L226 Difference]: Without dead ends: 482 [2021-12-17 12:00:32,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 158 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 65.1s TimeCoverageRelationStatistics Valid=531, Invalid=1725, Unknown=0, NotChecked=0, Total=2256 [2021-12-17 12:00:32,425 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 233 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 267 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2021-12-17 12:00:32,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 580 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 895 Invalid, 7 Unknown, 0 Unchecked, 18.8s Time] [2021-12-17 12:00:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-12-17 12:00:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 444. [2021-12-17 12:00:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 298 states have (on average 1.2281879194630871) internal successors, (366), 302 states have internal predecessors, (366), 107 states have call successors, (107), 38 states have call predecessors, (107), 38 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2021-12-17 12:00:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 579 transitions. [2021-12-17 12:00:32,495 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 579 transitions. Word has length 97 [2021-12-17 12:00:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:00:32,495 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 579 transitions. [2021-12-17 12:00:32,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.217391304347826) internal successors, (51), 18 states have internal predecessors, (51), 16 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2021-12-17 12:00:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 579 transitions. [2021-12-17 12:00:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-17 12:00:32,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:00:32,497 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:00:32,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 12:00:32,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-17 12:00:32,711 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:00:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:00:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 160443165, now seen corresponding path program 4 times [2021-12-17 12:00:32,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:00:32,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052677035] [2021-12-17 12:00:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:32,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:00:32,717 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:00:32,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085873913] [2021-12-17 12:00:32,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 12:00:32,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:32,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:00:32,720 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) [2021-12-17 12:00:32,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 12:00:32,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 12:00:32,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:00:32,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 12:00:32,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:00:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-12-17 12:00:32,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:00:32,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:00:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052677035] [2021-12-17 12:00:32,911 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:00:32,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085873913] [2021-12-17 12:00:32,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085873913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:00:32,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:00:32,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 12:00:32,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850388757] [2021-12-17 12:00:32,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:00:32,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 12:00:32,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:00:32,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 12:00:32,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 12:00:32,913 INFO L87 Difference]: Start difference. First operand 444 states and 579 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-17 12:00:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:00:33,015 INFO L93 Difference]: Finished difference Result 674 states and 943 transitions. [2021-12-17 12:00:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 12:00:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 101 [2021-12-17 12:00:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:00:33,017 INFO L225 Difference]: With dead ends: 674 [2021-12-17 12:00:33,017 INFO L226 Difference]: Without dead ends: 498 [2021-12-17 12:00:33,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 12:00:33,018 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:00:33,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 178 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:00:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-12-17 12:00:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 458. [2021-12-17 12:00:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 308 states have (on average 1.2337662337662338) internal successors, (380), 312 states have internal predecessors, (380), 111 states have call successors, (111), 38 states have call predecessors, (111), 38 states have return successors, (110), 107 states have call predecessors, (110), 110 states have call successors, (110) [2021-12-17 12:00:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 601 transitions. [2021-12-17 12:00:33,066 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 601 transitions. Word has length 101 [2021-12-17 12:00:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:00:33,067 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 601 transitions. [2021-12-17 12:00:33,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-17 12:00:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 601 transitions. [2021-12-17 12:00:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-17 12:00:33,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:00:33,068 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:00:33,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-17 12:00:33,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 12:00:33,284 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:00:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:00:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash -245423741, now seen corresponding path program 1 times [2021-12-17 12:00:33,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:00:33,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099285180] [2021-12-17 12:00:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:33,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:00:33,290 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:00:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874354898] [2021-12-17 12:00:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:33,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:33,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:00:33,296 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) [2021-12-17 12:00:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 12:00:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:00:33,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 12:00:33,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:00:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-17 12:00:33,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:00:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-12-17 12:00:33,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:00:33,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099285180] [2021-12-17 12:00:33,783 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:00:33,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874354898] [2021-12-17 12:00:33,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874354898] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:00:33,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:00:33,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2021-12-17 12:00:33,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416318440] [2021-12-17 12:00:33,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:00:33,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 12:00:33,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:00:33,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 12:00:33,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-12-17 12:00:33,785 INFO L87 Difference]: Start difference. First operand 458 states and 601 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 9 states have call successors, (33), 6 states have call predecessors, (33), 5 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2021-12-17 12:00:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:00:34,377 INFO L93 Difference]: Finished difference Result 1685 states and 2272 transitions. [2021-12-17 12:00:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 12:00:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 9 states have call successors, (33), 6 states have call predecessors, (33), 5 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 112 [2021-12-17 12:00:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:00:34,383 INFO L225 Difference]: With dead ends: 1685 [2021-12-17 12:00:34,383 INFO L226 Difference]: Without dead ends: 1492 [2021-12-17 12:00:34,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2021-12-17 12:00:34,384 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 288 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 12:00:34,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 439 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 12:00:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2021-12-17 12:00:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1400. [2021-12-17 12:00:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 893 states have (on average 1.1780515117581187) internal successors, (1052), 909 states have internal predecessors, (1052), 374 states have call successors, (374), 133 states have call predecessors, (374), 132 states have return successors, (366), 357 states have call predecessors, (366), 366 states have call successors, (366) [2021-12-17 12:00:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1792 transitions. [2021-12-17 12:00:34,582 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1792 transitions. Word has length 112 [2021-12-17 12:00:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:00:34,582 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1792 transitions. [2021-12-17 12:00:34,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 9 states have call successors, (33), 6 states have call predecessors, (33), 5 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2021-12-17 12:00:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1792 transitions. [2021-12-17 12:00:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-17 12:00:34,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:00:34,584 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:00:34,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-17 12:00:34,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 12:00:34,798 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:00:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:00:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1036292276, now seen corresponding path program 1 times [2021-12-17 12:00:34,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:00:34,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069294296] [2021-12-17 12:00:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:34,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:00:34,808 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:00:34,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108945273] [2021-12-17 12:00:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:34,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:00:34,833 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) [2021-12-17 12:00:34,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 12:00:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:00:34,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 12:00:34,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:00:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-17 12:00:35,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:00:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2021-12-17 12:00:35,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:00:35,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069294296] [2021-12-17 12:00:35,401 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:00:35,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108945273] [2021-12-17 12:00:35,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108945273] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:00:35,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:00:35,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2021-12-17 12:00:35,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030635963] [2021-12-17 12:00:35,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:00:35,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 12:00:35,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:00:35,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 12:00:35,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-12-17 12:00:35,405 INFO L87 Difference]: Start difference. First operand 1400 states and 1792 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 11 states have call successors, (41), 7 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2021-12-17 12:00:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:00:36,087 INFO L93 Difference]: Finished difference Result 1472 states and 1862 transitions. [2021-12-17 12:00:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 12:00:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 11 states have call successors, (41), 7 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 129 [2021-12-17 12:00:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:00:36,094 INFO L225 Difference]: With dead ends: 1472 [2021-12-17 12:00:36,095 INFO L226 Difference]: Without dead ends: 1432 [2021-12-17 12:00:36,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2021-12-17 12:00:36,097 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 304 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 12:00:36,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 409 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 12:00:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2021-12-17 12:00:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1418. [2021-12-17 12:00:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 911 states have (on average 1.145993413830955) internal successors, (1044), 927 states have internal predecessors, (1044), 374 states have call successors, (374), 133 states have call predecessors, (374), 132 states have return successors, (366), 357 states have call predecessors, (366), 366 states have call successors, (366) [2021-12-17 12:00:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1784 transitions. [2021-12-17 12:00:36,367 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1784 transitions. Word has length 129 [2021-12-17 12:00:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:00:36,369 INFO L470 AbstractCegarLoop]: Abstraction has 1418 states and 1784 transitions. [2021-12-17 12:00:36,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 11 states have call successors, (41), 7 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2021-12-17 12:00:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1784 transitions. [2021-12-17 12:00:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-17 12:00:36,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:00:36,373 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:00:36,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-17 12:00:36,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:36,599 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:00:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:00:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2066876172, now seen corresponding path program 2 times [2021-12-17 12:00:36,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:00:36,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029585134] [2021-12-17 12:00:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:36,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:00:36,611 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:00:36,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024374524] [2021-12-17 12:00:36,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:00:36,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:00:36,616 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) [2021-12-17 12:00:36,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 12:00:36,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:00:36,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:00:36,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-17 12:00:36,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:00:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 147 proven. 111 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2021-12-17 12:00:38,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:00:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2021-12-17 12:00:40,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:00:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029585134] [2021-12-17 12:00:40,777 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:00:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024374524] [2021-12-17 12:00:40,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024374524] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:00:40,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:00:40,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 30 [2021-12-17 12:00:40,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379720412] [2021-12-17 12:00:40,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:00:40,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-17 12:00:40,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:00:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-17 12:00:40,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2021-12-17 12:00:40,780 INFO L87 Difference]: Start difference. First operand 1418 states and 1784 transitions. Second operand has 30 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 15 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2021-12-17 12:00:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:00:50,060 INFO L93 Difference]: Finished difference Result 1553 states and 1938 transitions. [2021-12-17 12:00:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-17 12:00:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 15 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) Word has length 130 [2021-12-17 12:00:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:00:50,065 INFO L225 Difference]: With dead ends: 1553 [2021-12-17 12:00:50,065 INFO L226 Difference]: Without dead ends: 1513 [2021-12-17 12:00:50,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 230 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=534, Invalid=2546, Unknown=0, NotChecked=0, Total=3080 [2021-12-17 12:00:50,068 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 141 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-12-17 12:00:50,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 832 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2021-12-17 12:00:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-12-17 12:00:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1313. [2021-12-17 12:00:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 838 states have (on average 1.130071599045346) internal successors, (947), 849 states have internal predecessors, (947), 331 states have call successors, (331), 143 states have call predecessors, (331), 143 states have return successors, (330), 320 states have call predecessors, (330), 330 states have call successors, (330) [2021-12-17 12:00:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1608 transitions. [2021-12-17 12:00:50,243 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1608 transitions. Word has length 130 [2021-12-17 12:00:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:00:50,244 INFO L470 AbstractCegarLoop]: Abstraction has 1313 states and 1608 transitions. [2021-12-17 12:00:50,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 15 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2021-12-17 12:00:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1608 transitions. [2021-12-17 12:00:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-17 12:00:50,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:00:50,245 INFO L514 BasicCegarLoop]: trace histogram [20, 19, 19, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:00:50,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 12:00:50,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:50,462 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:00:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:00:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1962327715, now seen corresponding path program 2 times [2021-12-17 12:00:50,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:00:50,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584789549] [2021-12-17 12:00:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:00:50,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:00:50,468 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:00:50,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651878748] [2021-12-17 12:00:50,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:00:50,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:00:50,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:00:50,470 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) [2021-12-17 12:00:50,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-17 12:00:50,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:00:50,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:00:50,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 92 conjunts are in the unsatisfiable core [2021-12-17 12:00:50,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:00:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 184 proven. 182 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2021-12-17 12:00:51,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:00:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 227 proven. 84 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2021-12-17 12:00:59,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:00:59,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584789549] [2021-12-17 12:00:59,281 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:00:59,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651878748] [2021-12-17 12:00:59,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651878748] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:00:59,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:00:59,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2021-12-17 12:00:59,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607361351] [2021-12-17 12:00:59,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:00:59,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 12:00:59,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:00:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 12:00:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-12-17 12:00:59,283 INFO L87 Difference]: Start difference. First operand 1313 states and 1608 transitions. Second operand has 24 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 13 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (40), 15 states have call predecessors, (40), 12 states have call successors, (40) [2021-12-17 12:01:01,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 12:01:04,609 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 [] [2021-12-17 12:01:07,050 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 [] [2021-12-17 12:01:09,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 12:01:11,835 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 [] [2021-12-17 12:01:13,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 12:01:15,845 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 [] [2021-12-17 12:01:17,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 12:01:21,015 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 [] [2021-12-17 12:01:23,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 12:01:25,394 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 [] [2021-12-17 12:01:27,398 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 [] [2021-12-17 12:01:29,427 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 [] [2021-12-17 12:01:32,213 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 [] [2021-12-17 12:01:34,215 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 [] [2021-12-17 12:01:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:01:34,538 INFO L93 Difference]: Finished difference Result 1544 states and 1926 transitions. [2021-12-17 12:01:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 12:01:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 13 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (40), 15 states have call predecessors, (40), 12 states have call successors, (40) Word has length 147 [2021-12-17 12:01:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:01:34,543 INFO L225 Difference]: With dead ends: 1544 [2021-12-17 12:01:34,543 INFO L226 Difference]: Without dead ends: 1542 [2021-12-17 12:01:34,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 266 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 12:01:34,544 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 212 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 255 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2021-12-17 12:01:34,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 572 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 859 Invalid, 13 Unknown, 0 Unchecked, 33.1s Time] [2021-12-17 12:01:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2021-12-17 12:01:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1454. [2021-12-17 12:01:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 923 states have (on average 1.1473456121343446) internal successors, (1059), 942 states have internal predecessors, (1059), 383 states have call successors, (383), 147 states have call predecessors, (383), 147 states have return successors, (382), 364 states have call predecessors, (382), 382 states have call successors, (382) [2021-12-17 12:01:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1824 transitions. [2021-12-17 12:01:34,766 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1824 transitions. Word has length 147 [2021-12-17 12:01:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:01:34,766 INFO L470 AbstractCegarLoop]: Abstraction has 1454 states and 1824 transitions. [2021-12-17 12:01:34,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 13 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (40), 15 states have call predecessors, (40), 12 states have call successors, (40) [2021-12-17 12:01:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1824 transitions. [2021-12-17 12:01:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-12-17 12:01:34,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:01:34,770 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:01:34,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-17 12:01:34,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-17 12:01:34,991 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:01:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:01:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1253724604, now seen corresponding path program 2 times [2021-12-17 12:01:34,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:01:34,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559108799] [2021-12-17 12:01:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:01:34,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:01:35,001 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:01:35,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257606855] [2021-12-17 12:01:35,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:01:35,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:01:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:01:35,007 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) [2021-12-17 12:01:35,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-17 12:01:35,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:01:35,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:01:35,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-17 12:01:35,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:01:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-12-17 12:01:35,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:01:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2021-12-17 12:01:36,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:01:36,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559108799] [2021-12-17 12:01:36,250 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:01:36,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257606855] [2021-12-17 12:01:36,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257606855] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:01:36,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:01:36,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2021-12-17 12:01:36,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402741347] [2021-12-17 12:01:36,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:01:36,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 12:01:36,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:01:36,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 12:01:36,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 12:01:36,253 INFO L87 Difference]: Start difference. First operand 1454 states and 1824 transitions. Second operand has 34 states, 34 states have (on average 4.205882352941177) internal successors, (143), 34 states have internal predecessors, (143), 21 states have call successors, (81), 12 states have call predecessors, (81), 11 states have return successors, (80), 20 states have call predecessors, (80), 20 states have call successors, (80) [2021-12-17 12:01:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:01:38,981 INFO L93 Difference]: Finished difference Result 6388 states and 9142 transitions. [2021-12-17 12:01:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-12-17 12:01:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.205882352941177) internal successors, (143), 34 states have internal predecessors, (143), 21 states have call successors, (81), 12 states have call predecessors, (81), 11 states have return successors, (80), 20 states have call predecessors, (80), 20 states have call successors, (80) Word has length 256 [2021-12-17 12:01:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:01:39,009 INFO L225 Difference]: With dead ends: 6388 [2021-12-17 12:01:39,009 INFO L226 Difference]: Without dead ends: 6379 [2021-12-17 12:01:39,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1384, Invalid=2398, Unknown=0, NotChecked=0, Total=3782 [2021-12-17 12:01:39,013 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 824 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 12:01:39,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 794 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 12:01:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6379 states. [2021-12-17 12:01:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6379 to 6253. [2021-12-17 12:01:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6253 states, 3952 states have (on average 1.2320344129554657) internal successors, (4869), 4133 states have internal predecessors, (4869), 1919 states have call successors, (1919), 382 states have call predecessors, (1919), 381 states have return successors, (1904), 1737 states have call predecessors, (1904), 1904 states have call successors, (1904) [2021-12-17 12:01:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 8692 transitions. [2021-12-17 12:01:40,620 INFO L78 Accepts]: Start accepts. Automaton has 6253 states and 8692 transitions. Word has length 256 [2021-12-17 12:01:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:01:40,621 INFO L470 AbstractCegarLoop]: Abstraction has 6253 states and 8692 transitions. [2021-12-17 12:01:40,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.205882352941177) internal successors, (143), 34 states have internal predecessors, (143), 21 states have call successors, (81), 12 states have call predecessors, (81), 11 states have return successors, (80), 20 states have call predecessors, (80), 20 states have call successors, (80) [2021-12-17 12:01:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6253 states and 8692 transitions. [2021-12-17 12:01:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-12-17 12:01:40,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:01:40,628 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 36, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:01:40,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-12-17 12:01:40,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-17 12:01:40,846 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:01:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:01:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash -24986079, now seen corresponding path program 1 times [2021-12-17 12:01:40,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:01:40,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404116641] [2021-12-17 12:01:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:01:40,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:01:40,853 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:01:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23265553] [2021-12-17 12:01:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:01:40,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:01:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:01:40,856 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) [2021-12-17 12:01:40,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-17 12:01:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:01:40,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-17 12:01:40,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:01:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-12-17 12:01:41,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:01:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2021-12-17 12:01:42,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:01:42,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404116641] [2021-12-17 12:01:42,058 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:01:42,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23265553] [2021-12-17 12:01:42,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23265553] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:01:42,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:01:42,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2021-12-17 12:01:42,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124750688] [2021-12-17 12:01:42,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:01:42,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 12:01:42,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:01:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 12:01:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 12:01:42,060 INFO L87 Difference]: Start difference. First operand 6253 states and 8692 transitions. Second operand has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 21 states have call successors, (81), 12 states have call predecessors, (81), 11 states have return successors, (80), 20 states have call predecessors, (80), 20 states have call successors, (80) [2021-12-17 12:01:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:01:43,637 INFO L93 Difference]: Finished difference Result 7328 states and 10154 transitions. [2021-12-17 12:01:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-12-17 12:01:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 21 states have call successors, (81), 12 states have call predecessors, (81), 11 states have return successors, (80), 20 states have call predecessors, (80), 20 states have call successors, (80) Word has length 259 [2021-12-17 12:01:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:01:43,653 INFO L225 Difference]: With dead ends: 7328 [2021-12-17 12:01:43,654 INFO L226 Difference]: Without dead ends: 3486 [2021-12-17 12:01:43,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1383, Invalid=2399, Unknown=0, NotChecked=0, Total=3782 [2021-12-17 12:01:43,669 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 706 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 12:01:43,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 727 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 12:01:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-12-17 12:01:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3294. [2021-12-17 12:01:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 2043 states have (on average 1.1135584924131179) internal successors, (2275), 2078 states have internal predecessors, (2275), 895 states have call successors, (895), 355 states have call predecessors, (895), 355 states have return successors, (894), 860 states have call predecessors, (894), 894 states have call successors, (894) [2021-12-17 12:01:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4064 transitions. [2021-12-17 12:01:44,516 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4064 transitions. Word has length 259 [2021-12-17 12:01:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:01:44,516 INFO L470 AbstractCegarLoop]: Abstraction has 3294 states and 4064 transitions. [2021-12-17 12:01:44,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 21 states have call successors, (81), 12 states have call predecessors, (81), 11 states have return successors, (80), 20 states have call predecessors, (80), 20 states have call successors, (80) [2021-12-17 12:01:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4064 transitions. [2021-12-17 12:01:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2021-12-17 12:01:44,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:01:44,533 INFO L514 BasicCegarLoop]: trace histogram [77, 76, 76, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 10, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:01:44,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-17 12:01:44,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:01:44,746 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:01:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:01:44,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1206650765, now seen corresponding path program 2 times [2021-12-17 12:01:44,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:01:44,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173210256] [2021-12-17 12:01:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:01:44,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:01:44,768 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:01:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728781582] [2021-12-17 12:01:44,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:01:44,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:01:44,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:01:44,770 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) [2021-12-17 12:01:44,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-17 12:01:44,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:01:44,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:01:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-17 12:01:44,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:01:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 12389 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2021-12-17 12:01:45,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:01:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 1445 refuted. 0 times theorem prover too weak. 11424 trivial. 0 not checked. [2021-12-17 12:01:46,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:01:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173210256] [2021-12-17 12:01:46,506 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:01:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728781582] [2021-12-17 12:01:46,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728781582] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:01:46,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:01:46,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 54 [2021-12-17 12:01:46,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221130292] [2021-12-17 12:01:46,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:01:46,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-17 12:01:46,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:01:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-17 12:01:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2021-12-17 12:01:46,510 INFO L87 Difference]: Start difference. First operand 3294 states and 4064 transitions. Second operand has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 37 states have call successors, (161), 22 states have call predecessors, (161), 21 states have return successors, (160), 36 states have call predecessors, (160), 36 states have call successors, (160) [2021-12-17 12:01:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:01:49,734 INFO L93 Difference]: Finished difference Result 6277 states and 7985 transitions. [2021-12-17 12:01:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-12-17 12:01:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 37 states have call successors, (161), 22 states have call predecessors, (161), 21 states have return successors, (160), 36 states have call predecessors, (160), 36 states have call successors, (160) Word has length 512 [2021-12-17 12:01:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:01:49,762 INFO L225 Difference]: With dead ends: 6277 [2021-12-17 12:01:49,762 INFO L226 Difference]: Without dead ends: 5925 [2021-12-17 12:01:49,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 969 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3809, Invalid=6493, Unknown=0, NotChecked=0, Total=10302 [2021-12-17 12:01:49,770 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 1425 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 1318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1318 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:01:49,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 1002 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1318 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-17 12:01:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2021-12-17 12:01:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5585. [2021-12-17 12:01:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 3433 states have (on average 1.1136032624526653) internal successors, (3823), 3488 states have internal predecessors, (3823), 1536 states have call successors, (1536), 616 states have call predecessors, (1536), 615 states have return successors, (1534), 1480 states have call predecessors, (1534), 1534 states have call successors, (1534) [2021-12-17 12:01:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 6893 transitions. [2021-12-17 12:01:50,941 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 6893 transitions. Word has length 512 [2021-12-17 12:01:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:01:50,942 INFO L470 AbstractCegarLoop]: Abstraction has 5585 states and 6893 transitions. [2021-12-17 12:01:50,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 37 states have call successors, (161), 22 states have call predecessors, (161), 21 states have return successors, (160), 36 states have call predecessors, (160), 36 states have call successors, (160) [2021-12-17 12:01:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 6893 transitions. [2021-12-17 12:01:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2021-12-17 12:01:50,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:01:50,956 INFO L514 BasicCegarLoop]: trace histogram [81, 80, 80, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 10, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:01:50,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-17 12:01:51,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:01:51,171 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:01:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:01:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash -170830244, now seen corresponding path program 3 times [2021-12-17 12:01:51,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:01:51,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91916799] [2021-12-17 12:01:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:01:51,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:01:51,192 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:01:51,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869687505] [2021-12-17 12:01:51,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 12:01:51,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:01:51,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:01:51,194 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) [2021-12-17 12:01:51,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-17 12:06:06,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2021-12-17 12:06:06,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:06:07,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-17 12:06:07,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:06:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 13690 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2021-12-17 12:06:07,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:06:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 1530 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2021-12-17 12:06:09,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:06:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91916799] [2021-12-17 12:06:09,023 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:06:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869687505] [2021-12-17 12:06:09,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869687505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:06:09,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:06:09,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 54 [2021-12-17 12:06:09,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276269865] [2021-12-17 12:06:09,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:06:09,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-17 12:06:09,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:06:09,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-17 12:06:09,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2021-12-17 12:06:09,042 INFO L87 Difference]: Start difference. First operand 5585 states and 6893 transitions. Second operand has 54 states, 54 states have (on average 5.018518518518518) internal successors, (271), 54 states have internal predecessors, (271), 38 states have call successors, (169), 23 states have call predecessors, (169), 22 states have return successors, (168), 37 states have call predecessors, (168), 37 states have call successors, (168) [2021-12-17 12:06:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:06:12,530 INFO L93 Difference]: Finished difference Result 5604 states and 6915 transitions. [2021-12-17 12:06:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-12-17 12:06:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.018518518518518) internal successors, (271), 54 states have internal predecessors, (271), 38 states have call successors, (169), 23 states have call predecessors, (169), 22 states have return successors, (168), 37 states have call predecessors, (168), 37 states have call successors, (168) Word has length 529 [2021-12-17 12:06:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:06:12,557 INFO L225 Difference]: With dead ends: 5604 [2021-12-17 12:06:12,557 INFO L226 Difference]: Without dead ends: 5594 [2021-12-17 12:06:12,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1003 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3810, Invalid=6492, Unknown=0, NotChecked=0, Total=10302 [2021-12-17 12:06:12,564 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 1217 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-17 12:06:12,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1217 Valid, 1144 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-17 12:06:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2021-12-17 12:06:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5594. [2021-12-17 12:06:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5594 states, 3443 states have (on average 1.1022364217252396) internal successors, (3795), 3498 states have internal predecessors, (3795), 1535 states have call successors, (1535), 615 states have call predecessors, (1535), 615 states have return successors, (1534), 1480 states have call predecessors, (1534), 1534 states have call successors, (1534) [2021-12-17 12:06:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 6864 transitions. [2021-12-17 12:06:13,734 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 6864 transitions. Word has length 529 [2021-12-17 12:06:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:06:13,735 INFO L470 AbstractCegarLoop]: Abstraction has 5594 states and 6864 transitions. [2021-12-17 12:06:13,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.018518518518518) internal successors, (271), 54 states have internal predecessors, (271), 38 states have call successors, (169), 23 states have call predecessors, (169), 22 states have return successors, (168), 37 states have call predecessors, (168), 37 states have call successors, (168) [2021-12-17 12:06:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 6864 transitions. [2021-12-17 12:06:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2021-12-17 12:06:13,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:06:13,758 INFO L514 BasicCegarLoop]: trace histogram [133, 132, 132, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 18, 17, 17, 17, 17, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:06:13,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-17 12:06:13,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-17 12:06:13,971 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:06:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:06:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 265637036, now seen corresponding path program 4 times [2021-12-17 12:06:13,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:06:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724189959] [2021-12-17 12:06:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:06:13,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:06:13,997 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:06:13,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477238264] [2021-12-17 12:06:13,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 12:06:13,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:06:13,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:06:14,012 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) [2021-12-17 12:06:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-17 12:06:21,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 12:06:21,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-17 12:06:21,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 12:06:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 12:06:34,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 12:06:34,072 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 12:06:34,073 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 12:06:34,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-17 12:06:34,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 12:06:34,290 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:06:34,294 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 12:06:34,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 12:06:34 BoogieIcfgContainer [2021-12-17 12:06:34,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 12:06:34,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 12:06:34,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 12:06:34,449 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 12:06:34,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:58:37" (3/4) ... [2021-12-17 12:06:34,452 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 12:06:34,598 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 12:06:34,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 12:06:34,599 INFO L158 Benchmark]: Toolchain (without parser) took 477701.33ms. Allocated memory was 111.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 82.7MB in the beginning and 804.1MB in the end (delta: -721.4MB). Peak memory consumption was 955.9MB. Max. memory is 16.1GB. [2021-12-17 12:06:34,599 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 111.1MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:06:34,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.03ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 83.6MB in the end (delta: -1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 12:06:34,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.46ms. Allocated memory is still 111.1MB. Free memory was 83.4MB in the beginning and 81.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 12:06:34,600 INFO L158 Benchmark]: Boogie Preprocessor took 31.30ms. Allocated memory is still 111.1MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:06:34,600 INFO L158 Benchmark]: RCFGBuilder took 274.83ms. Allocated memory is still 111.1MB. Free memory was 80.8MB in the beginning and 70.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 12:06:34,600 INFO L158 Benchmark]: TraceAbstraction took 476931.78ms. Allocated memory was 111.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 69.8MB in the beginning and 844.8MB in the end (delta: -775.0MB). Peak memory consumption was 905.3MB. Max. memory is 16.1GB. [2021-12-17 12:06:34,600 INFO L158 Benchmark]: Witness Printer took 149.09ms. Allocated memory is still 1.8GB. Free memory was 844.8MB in the beginning and 804.1MB in the end (delta: 40.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-17 12:06:34,601 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.23ms. Allocated memory is still 111.1MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.03ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 83.6MB in the end (delta: -1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.46ms. Allocated memory is still 111.1MB. Free memory was 83.4MB in the beginning and 81.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.30ms. Allocated memory is still 111.1MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.83ms. Allocated memory is still 111.1MB. Free memory was 80.8MB in the beginning and 70.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 476931.78ms. Allocated memory was 111.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 69.8MB in the beginning and 844.8MB in the end (delta: -775.0MB). Peak memory consumption was 905.3MB. Max. memory is 16.1GB. * Witness Printer took 149.09ms. Allocated memory is still 1.8GB. Free memory was 844.8MB in the beginning and 804.1MB in the end (delta: 40.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * 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 [counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=2584, y=4181] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=2584, y=4181] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=2584, b=4181, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=2584, b=4181, c=2584, counter=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=2584, b=4181, c=2584, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=4181, b=2584, c=2584, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=4181, b=2584, c=2584, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=4181, b=2584, c=4181, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=4181, b=2584, c=4181, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=4181, b=2584, c=1597, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=4181, b=2584, c=1597, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=2584, b=1597, c=1597, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=2584, b=1597, c=1597, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=2584, b=1597, c=2584, counter=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=2584, b=1597, c=2584, counter=7, counter++=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=2584, b=1597, c=987, counter=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=2584, b=1597, c=987, counter=8, counter++=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=1597, b=987, c=987, counter=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=1597, b=987, c=987, counter=9, counter++=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=1597, b=987, c=1597, counter=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=1597, b=987, c=1597, counter=10, counter++=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=1597, b=987, c=610, counter=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=1597, b=987, c=610, counter=11, counter++=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=987, b=610, c=610, counter=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=987, b=610, c=610, counter=12, counter++=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=987, b=610, c=987, counter=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=987, b=610, c=987, counter=13, counter++=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=987, b=610, c=377, counter=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=987, b=610, c=377, counter=14, counter++=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=610, b=377, c=377, counter=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=610, b=377, c=377, counter=15, counter++=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=610, b=377, c=610, counter=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=610, b=377, c=610, counter=16, counter++=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=610, b=377, c=233, counter=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=610, b=377, c=233, counter=17, counter++=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=377, b=233, c=233, counter=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=377, b=233, c=233, counter=18, counter++=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=377, b=233, c=377, counter=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=377, b=233, c=377, counter=19, counter++=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=377, b=233, c=144, counter=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=377, b=233, c=144, counter=20, counter++=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=233, b=144, c=144, counter=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=233, b=144, c=144, counter=21, counter++=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=233, b=144, c=233, counter=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=233, b=144, c=233, counter=22, counter++=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=233, b=144, c=89, counter=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=233, b=144, c=89, counter=23, counter++=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=144, b=89, c=89, counter=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=144, b=89, c=89, counter=24, counter++=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=144, b=89, c=144, counter=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=144, b=89, c=144, counter=25, counter++=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=144, b=89, c=55, counter=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=144, b=89, c=55, counter=26, counter++=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=89, b=55, c=55, counter=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=89, b=55, c=55, counter=27, counter++=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=89, b=55, c=89, counter=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=89, b=55, c=89, counter=28, counter++=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=89, b=55, c=34, counter=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=89, b=55, c=34, counter=29, counter++=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=55, b=34, c=34, counter=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=55, b=34, c=34, counter=30, counter++=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=55, b=34, c=55, counter=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=55, b=34, c=55, counter=31, counter++=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=55, b=34, c=21, counter=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=55, b=34, c=21, counter=32, counter++=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=34, b=21, c=21, counter=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=34, b=21, c=21, counter=33, counter++=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=34, b=21, c=34, counter=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=34, b=21, c=34, counter=34, counter++=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=34, b=21, c=13, counter=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=34, b=21, c=13, counter=35, counter++=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=21, b=13, c=13, counter=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=21, b=13, c=13, counter=36, counter++=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=21, b=13, c=21, counter=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=21, b=13, c=21, counter=37, counter++=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=21, b=13, c=8, counter=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=21, b=13, c=8, counter=38, counter++=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=13, b=8, c=8, counter=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=13, b=8, c=8, counter=39, counter++=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=13, b=8, c=13, counter=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=13, b=8, c=13, counter=40, counter++=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=13, b=8, c=5, counter=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=13, b=8, c=5, counter=41, counter++=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=8, b=5, c=5, counter=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=8, b=5, c=5, counter=42, counter++=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=8, b=5, c=8, counter=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=8, b=5, c=8, counter=43, counter++=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=8, b=5, c=3, counter=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=8, b=5, c=3, counter=44, counter++=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=5, b=3, c=3, counter=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=5, b=3, c=3, counter=45, counter++=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=5, b=3, c=5, counter=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=5, b=3, c=5, counter=46, counter++=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=5, b=3, c=2, counter=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=5, b=3, c=2, counter=47, counter++=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=3, b=2, c=2, counter=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=3, b=2, c=2, counter=48, counter++=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [a=3, b=2, c=3, counter=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=3, b=2, c=3, counter=49, counter++=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [a=3, b=2, c=1, counter=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [a=3, b=2, c=1, counter=50, counter++=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [a=2, b=1, c=1, counter=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [a=2, b=1, c=1, counter=51, counter++=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND FALSE !(counter++<50) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 476.7s, OverallIterations: 26, TraceHistogramMax: 133, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 137.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 6017 SdHoareTripleChecker+Valid, 64.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5935 mSDsluCounter, 9773 SdHoareTripleChecker+Invalid, 63.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7985 mSDsCounter, 5668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9038 IncrementalHoareTripleChecker+Invalid, 14726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5668 mSolverCounterUnsat, 1788 mSDtfsCounter, 9038 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5933 GetRequests, 5200 SyntacticMatches, 45 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6623 ImplicationChecksByTransitivity, 84.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6253occurred in iteration=22, InterpolantAutomatonStates: 624, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 1233 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 264.4s SatisfiabilityAnalysisTime, 49.4s InterpolantComputationTime, 3867 NumberOfCodeBlocks, 3797 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 5623 ConstructedInterpolants, 0 QuantifiedInterpolants, 23857 SizeOfPredicates, 203 NumberOfNonLiveVariables, 7503 ConjunctsInSsa, 715 ConjunctsInUnsatCore, 43 InterpolantComputations, 7 PerfectInterpolantSequences, 37289/73586 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! [2021-12-17 12:06:34,657 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE