./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.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/prod4br-ll_unwindbound20.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 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 13:45:43,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 13:45:43,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 13:45:43,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 13:45:43,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 13:45:43,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 13:45:43,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 13:45:43,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 13:45:43,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 13:45:43,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 13:45:43,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 13:45:43,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 13:45:43,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 13:45:43,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 13:45:43,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 13:45:43,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 13:45:43,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 13:45:43,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 13:45:43,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 13:45:43,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 13:45:43,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 13:45:43,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 13:45:43,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 13:45:43,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 13:45:43,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 13:45:43,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 13:45:43,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 13:45:43,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 13:45:43,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 13:45:43,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 13:45:43,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 13:45:43,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 13:45:43,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 13:45:43,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 13:45:43,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 13:45:43,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 13:45:43,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 13:45:43,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 13:45:43,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 13:45:43,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 13:45:43,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 13:45:43,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 13:45:43,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 13:45:43,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 13:45:43,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 13:45:43,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 13:45:43,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 13:45:43,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 13:45:43,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 13:45:43,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 13:45:43,540 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 13:45:43,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 13:45:43,541 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 13:45:43,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 13:45:43,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 13:45:43,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 13:45:43,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 13:45:43,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 13:45:43,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 13:45:43,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 13:45:43,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 13:45:43,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 13:45:43,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 13:45:43,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 13:45:43,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 13:45:43,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 13:45:43,544 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 13:45:43,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 13:45:43,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 13:45:43,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 13:45:43,545 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 -> 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca [2021-12-17 13:45:43,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 13:45:43,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 13:45:43,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 13:45:43,758 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 13:45:43,758 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 13:45:43,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2021-12-17 13:45:43,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5719026/34e09061363642cd8dc7288c3bac8894/FLAG95e9925e9 [2021-12-17 13:45:44,187 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 13:45:44,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2021-12-17 13:45:44,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5719026/34e09061363642cd8dc7288c3bac8894/FLAG95e9925e9 [2021-12-17 13:45:44,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa5719026/34e09061363642cd8dc7288c3bac8894 [2021-12-17 13:45:44,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 13:45:44,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 13:45:44,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 13:45:44,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 13:45:44,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 13:45:44,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477e7252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44, skipping insertion in model container [2021-12-17 13:45:44,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 13:45:44,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 13:45:44,342 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/prod4br-ll_unwindbound20.c[524,537] [2021-12-17 13:45:44,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 13:45:44,374 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 13:45:44,381 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/prod4br-ll_unwindbound20.c[524,537] [2021-12-17 13:45:44,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 13:45:44,394 INFO L208 MainTranslator]: Completed translation [2021-12-17 13:45:44,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44 WrapperNode [2021-12-17 13:45:44,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 13:45:44,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 13:45:44,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 13:45:44,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 13:45:44,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,416 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2021-12-17 13:45:44,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 13:45:44,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 13:45:44,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 13:45:44,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 13:45:44,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 13:45:44,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 13:45:44,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 13:45:44,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 13:45:44,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (1/1) ... [2021-12-17 13:45:44,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 13:45:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:44,451 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 13:45:44,453 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 13:45:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 13:45:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 13:45:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 13:45:44,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 13:45:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 13:45:44,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 13:45:44,522 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 13:45:44,523 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 13:45:44,629 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 13:45:44,633 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 13:45:44,633 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 13:45:44,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:45:44 BoogieIcfgContainer [2021-12-17 13:45:44,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 13:45:44,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 13:45:44,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 13:45:44,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 13:45:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 01:45:44" (1/3) ... [2021-12-17 13:45:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5233185f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:45:44, skipping insertion in model container [2021-12-17 13:45:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 01:45:44" (2/3) ... [2021-12-17 13:45:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5233185f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 01:45:44, skipping insertion in model container [2021-12-17 13:45:44,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:45:44" (3/3) ... [2021-12-17 13:45:44,639 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound20.c [2021-12-17 13:45:44,642 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 13:45:44,642 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 13:45:44,677 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 13:45:44,681 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 13:45:44,682 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 13:45:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 13:45:44,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:44,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:44,694 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2021-12-17 13:45:44,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:44,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051708426] [2021-12-17 13:45:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:44,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:44,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051708426] [2021-12-17 13:45:44,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051708426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:44,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:44,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 13:45:44,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985900557] [2021-12-17 13:45:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:44,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 13:45:44,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:44,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 13:45:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 13:45:44,832 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 13:45:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:44,847 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2021-12-17 13:45:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 13:45:44,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 13:45:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:44,854 INFO L225 Difference]: With dead ends: 43 [2021-12-17 13:45:44,855 INFO L226 Difference]: Without dead ends: 19 [2021-12-17 13:45:44,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:45:44,860 INFO L933 BasicCegarLoop]: 29 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, 29 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 13:45:44,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-17 13:45:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-17 13:45:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-12-17 13:45:44,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2021-12-17 13:45:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:44,892 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-17 13:45:44,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 13:45:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-12-17 13:45:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 13:45:44,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:44,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:44,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 13:45:44,895 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2021-12-17 13:45:44,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:44,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659332339] [2021-12-17 13:45:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:44,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:44,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659332339] [2021-12-17 13:45:44,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659332339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:44,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:44,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 13:45:44,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342231053] [2021-12-17 13:45:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:44,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 13:45:44,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 13:45:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 13:45:44,998 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 13:45:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:45,020 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2021-12-17 13:45:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 13:45:45,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 13:45:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:45,021 INFO L225 Difference]: With dead ends: 29 [2021-12-17 13:45:45,022 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 13:45:45,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 13:45:45,023 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:45,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 13:45:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 13:45:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-12-17 13:45:45,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2021-12-17 13:45:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:45,035 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-17 13:45:45,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 13:45:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-12-17 13:45:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 13:45:45,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:45,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:45,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 13:45:45,036 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2021-12-17 13:45:45,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:45,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099029194] [2021-12-17 13:45:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:45,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:45,045 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:45,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040541726] [2021-12-17 13:45:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:45,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:45,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:45,079 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 13:45:45,083 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 13:45:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:45,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 13:45:45,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:45,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 13:45:45,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:45,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099029194] [2021-12-17 13:45:45,231 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:45,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040541726] [2021-12-17 13:45:45,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040541726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:45,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:45,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 13:45:45,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902488599] [2021-12-17 13:45:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:45,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 13:45:45,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 13:45:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 13:45:45,238 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 13:45:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:45,304 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-12-17 13:45:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 13:45:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 13:45:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:45,305 INFO L225 Difference]: With dead ends: 34 [2021-12-17 13:45:45,307 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 13:45:45,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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 13:45:45,308 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:45,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 13:45:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2021-12-17 13:45:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-17 13:45:45,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2021-12-17 13:45:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:45,316 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-17 13:45:45,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 13:45:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-17 13:45:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 13:45:45,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:45,317 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:45,334 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 13:45:45,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:45,534 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2021-12-17 13:45:45,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:45,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070528629] [2021-12-17 13:45:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:45,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:45,542 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:45,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039711100] [2021-12-17 13:45:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:45,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:45,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:45,543 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 13:45:45,563 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 13:45:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:45,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 13:45:45,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:45,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:45,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:45,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070528629] [2021-12-17 13:45:45,906 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:45,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039711100] [2021-12-17 13:45:45,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039711100] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:45,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:45,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2021-12-17 13:45:45,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868875790] [2021-12-17 13:45:45,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:45,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 13:45:45,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:45,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 13:45:45,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-17 13:45:45,908 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:46,307 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-12-17 13:45:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 13:45:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-12-17 13:45:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:46,310 INFO L225 Difference]: With dead ends: 47 [2021-12-17 13:45:46,310 INFO L226 Difference]: Without dead ends: 45 [2021-12-17 13:45:46,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2021-12-17 13:45:46,311 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:46,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 101 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 13:45:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-17 13:45:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-12-17 13:45:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 13:45:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-12-17 13:45:46,316 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2021-12-17 13:45:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:46,317 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-12-17 13:45:46,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2021-12-17 13:45:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 13:45:46,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:46,318 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:46,340 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 13:45:46,536 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,SelfDestructingSolverStorable3 [2021-12-17 13:45:46,536 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times [2021-12-17 13:45:46,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:46,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318698932] [2021-12-17 13:45:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:46,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:46,543 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:46,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569051070] [2021-12-17 13:45:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:46,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:46,544 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 13:45:46,545 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 13:45:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:46,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 13:45:46,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:46,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:46,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:46,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318698932] [2021-12-17 13:45:46,672 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:46,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569051070] [2021-12-17 13:45:46,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569051070] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:46,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:46,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-17 13:45:46,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459966851] [2021-12-17 13:45:46,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:46,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 13:45:46,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:46,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 13:45:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-17 13:45:46,675 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:46,737 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2021-12-17 13:45:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 13:45:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-12-17 13:45:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:46,738 INFO L225 Difference]: With dead ends: 95 [2021-12-17 13:45:46,738 INFO L226 Difference]: Without dead ends: 85 [2021-12-17 13:45:46,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 13:45:46,739 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:46,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-17 13:45:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2021-12-17 13:45:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 61 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 13:45:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2021-12-17 13:45:46,752 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 19 [2021-12-17 13:45:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:46,752 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2021-12-17 13:45:46,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2021-12-17 13:45:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 13:45:46,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:46,755 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:46,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 13:45:46,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:46,957 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1754945923, now seen corresponding path program 1 times [2021-12-17 13:45:46,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:46,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332343460] [2021-12-17 13:45:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:46,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:46,964 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:46,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314363658] [2021-12-17 13:45:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:46,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:46,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:46,971 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 13:45:46,973 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 13:45:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:47,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-17 13:45:47,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:47,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:47,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:47,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332343460] [2021-12-17 13:45:47,395 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:47,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314363658] [2021-12-17 13:45:47,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314363658] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 13:45:47,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 13:45:47,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2021-12-17 13:45:47,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185158003] [2021-12-17 13:45:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:47,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 13:45:47,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 13:45:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-17 13:45:47,400 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 13:45:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:47,614 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2021-12-17 13:45:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 13:45:47,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-12-17 13:45:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:47,617 INFO L225 Difference]: With dead ends: 93 [2021-12-17 13:45:47,617 INFO L226 Difference]: Without dead ends: 87 [2021-12-17 13:45:47,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-17 13:45:47,618 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:47,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 55 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 13:45:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-17 13:45:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2021-12-17 13:45:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-17 13:45:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2021-12-17 13:45:47,626 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2021-12-17 13:45:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:47,626 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2021-12-17 13:45:47,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 13:45:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2021-12-17 13:45:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 13:45:47,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:47,627 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:47,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 13:45:47,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:47,844 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1942139802, now seen corresponding path program 1 times [2021-12-17 13:45:47,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:47,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433162229] [2021-12-17 13:45:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:47,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:47,849 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:47,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558342512] [2021-12-17 13:45:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:47,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:47,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:47,851 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 13:45:47,852 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 13:45:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:47,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 13:45:47,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 13:45:47,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 13:45:47,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433162229] [2021-12-17 13:45:47,946 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558342512] [2021-12-17 13:45:47,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558342512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:47,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:47,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 13:45:47,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828232277] [2021-12-17 13:45:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:47,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 13:45:47,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 13:45:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 13:45:47,948 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:48,037 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2021-12-17 13:45:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 13:45:48,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-12-17 13:45:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:48,039 INFO L225 Difference]: With dead ends: 108 [2021-12-17 13:45:48,039 INFO L226 Difference]: Without dead ends: 96 [2021-12-17 13:45:48,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-17 13:45:48,040 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:48,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-17 13:45:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2021-12-17 13:45:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-17 13:45:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2021-12-17 13:45:48,048 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 21 [2021-12-17 13:45:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:48,048 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2021-12-17 13:45:48,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2021-12-17 13:45:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 13:45:48,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:48,049 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:48,073 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 13:45:48,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:48,266 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1954557947, now seen corresponding path program 1 times [2021-12-17 13:45:48,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:48,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796406693] [2021-12-17 13:45:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:48,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:48,272 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:48,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977285642] [2021-12-17 13:45:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:48,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:48,275 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 13:45:48,302 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 13:45:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:48,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 13:45:48,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 13:45:48,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 13:45:48,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796406693] [2021-12-17 13:45:48,360 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977285642] [2021-12-17 13:45:48,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977285642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 13:45:48,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 13:45:48,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 13:45:48,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803999586] [2021-12-17 13:45:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:48,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 13:45:48,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 13:45:48,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 13:45:48,362 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:48,401 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2021-12-17 13:45:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 13:45:48,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2021-12-17 13:45:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:48,402 INFO L225 Difference]: With dead ends: 133 [2021-12-17 13:45:48,403 INFO L226 Difference]: Without dead ends: 121 [2021-12-17 13:45:48,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 13:45:48,403 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:48,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 94 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 13:45:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-17 13:45:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2021-12-17 13:45:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 84 states have internal predecessors, (107), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-17 13:45:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2021-12-17 13:45:48,412 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 32 [2021-12-17 13:45:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:48,412 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2021-12-17 13:45:48,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 13:45:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2021-12-17 13:45:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 13:45:48,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:48,414 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:48,451 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 13:45:48,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:48,631 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash 346264643, now seen corresponding path program 1 times [2021-12-17 13:45:48,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:48,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174582647] [2021-12-17 13:45:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:48,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:48,637 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852097708] [2021-12-17 13:45:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:48,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:48,639 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 13:45:48,640 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 13:45:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 13:45:48,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 13:45:48,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 13:45:48,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 13:45:49,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174582647] [2021-12-17 13:45:49,002 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852097708] [2021-12-17 13:45:49,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852097708] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 13:45:49,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 13:45:49,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 12 [2021-12-17 13:45:49,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964284363] [2021-12-17 13:45:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 13:45:49,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 13:45:49,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:49,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 13:45:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-17 13:45:49,004 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:49,142 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2021-12-17 13:45:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 13:45:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2021-12-17 13:45:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:49,143 INFO L225 Difference]: With dead ends: 112 [2021-12-17 13:45:49,143 INFO L226 Difference]: Without dead ends: 92 [2021-12-17 13:45:49,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-17 13:45:49,143 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:49,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 13:45:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-17 13:45:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 58. [2021-12-17 13:45:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 13:45:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2021-12-17 13:45:49,149 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 32 [2021-12-17 13:45:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:49,149 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2021-12-17 13:45:49,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 13:45:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2021-12-17 13:45:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 13:45:49,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:49,150 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:49,177 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 13:45:49,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:49,367 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 136508765, now seen corresponding path program 2 times [2021-12-17 13:45:49,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:49,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441647780] [2021-12-17 13:45:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:49,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:49,373 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:49,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777210537] [2021-12-17 13:45:49,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 13:45:49,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:49,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:49,374 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 13:45:49,375 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 13:45:49,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 13:45:49,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 13:45:49,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 13:45:49,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:49,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 13:45:49,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:49,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441647780] [2021-12-17 13:45:49,589 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:49,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777210537] [2021-12-17 13:45:49,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777210537] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:49,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:49,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-17 13:45:49,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767295791] [2021-12-17 13:45:49,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:49,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 13:45:49,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 13:45:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-17 13:45:49,591 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 13:45:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:49,769 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2021-12-17 13:45:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 13:45:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 46 [2021-12-17 13:45:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:49,776 INFO L225 Difference]: With dead ends: 132 [2021-12-17 13:45:49,776 INFO L226 Difference]: Without dead ends: 124 [2021-12-17 13:45:49,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-17 13:45:49,777 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 147 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:49,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 218 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 13:45:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-17 13:45:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-17 13:45:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-17 13:45:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2021-12-17 13:45:49,785 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 46 [2021-12-17 13:45:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:49,785 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2021-12-17 13:45:49,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 13:45:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-12-17 13:45:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-17 13:45:49,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:49,787 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:49,806 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 13:45:50,003 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,SelfDestructingSolverStorable9 [2021-12-17 13:45:50,004 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1689445411, now seen corresponding path program 3 times [2021-12-17 13:45:50,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:50,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264832299] [2021-12-17 13:45:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:50,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:50,012 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:50,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858751148] [2021-12-17 13:45:50,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 13:45:50,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:50,014 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 13:45:50,015 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 13:45:50,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-17 13:45:50,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 13:45:50,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 13:45:50,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 13:45:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 13:45:50,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 13:45:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-17 13:45:50,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 13:45:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264832299] [2021-12-17 13:45:50,717 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 13:45:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858751148] [2021-12-17 13:45:50,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858751148] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 13:45:50,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 13:45:50,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-17 13:45:50,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110489072] [2021-12-17 13:45:50,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 13:45:50,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 13:45:50,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 13:45:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 13:45:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2021-12-17 13:45:50,719 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 13:45:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 13:45:51,002 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2021-12-17 13:45:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-17 13:45:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 100 [2021-12-17 13:45:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 13:45:51,004 INFO L225 Difference]: With dead ends: 242 [2021-12-17 13:45:51,004 INFO L226 Difference]: Without dead ends: 234 [2021-12-17 13:45:51,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 13:45:51,005 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 520 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 13:45:51,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 288 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 13:45:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-17 13:45:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-17 13:45:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 191 states have internal predecessors, (252), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2021-12-17 13:45:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 295 transitions. [2021-12-17 13:45:51,016 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 295 transitions. Word has length 100 [2021-12-17 13:45:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 13:45:51,017 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 295 transitions. [2021-12-17 13:45:51,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2021-12-17 13:45:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 295 transitions. [2021-12-17 13:45:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-17 13:45:51,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 13:45:51,025 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:51,046 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 13:45:51,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:51,246 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 13:45:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 13:45:51,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1595985571, now seen corresponding path program 4 times [2021-12-17 13:45:51,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 13:45:51,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750026582] [2021-12-17 13:45:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 13:45:51,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 13:45:51,255 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 13:45:51,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521083019] [2021-12-17 13:45:51,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 13:45:51,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 13:45:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 13:45:51,256 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 13:45:51,299 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 13:45:51,432 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 13:45:51,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-17 13:45:51,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 13:45:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 13:45:51,689 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 13:45:51,689 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 13:45:51,690 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 13:45:51,726 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 13:45:51,926 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,SelfDestructingSolverStorable11 [2021-12-17 13:45:51,929 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 13:45:51,931 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 13:45:51,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 01:45:51 BoogieIcfgContainer [2021-12-17 13:45:51,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 13:45:51,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 13:45:51,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 13:45:51,984 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 13:45:51,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 01:45:44" (3/4) ... [2021-12-17 13:45:51,986 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 13:45:52,048 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 13:45:52,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 13:45:52,049 INFO L158 Benchmark]: Toolchain (without parser) took 7838.30ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 87.8MB in the beginning and 138.2MB in the end (delta: -50.4MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,049 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 13:45:52,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.01ms. Allocated memory is still 113.2MB. Free memory was 87.5MB in the beginning and 89.5MB in the end (delta: -1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.66ms. Allocated memory is still 113.2MB. Free memory was 89.5MB in the beginning and 87.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,050 INFO L158 Benchmark]: Boogie Preprocessor took 11.96ms. Allocated memory is still 113.2MB. Free memory was 87.8MB in the beginning and 86.8MB in the end (delta: 959.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,050 INFO L158 Benchmark]: RCFGBuilder took 205.11ms. Allocated memory is still 113.2MB. Free memory was 86.5MB in the beginning and 76.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,050 INFO L158 Benchmark]: TraceAbstraction took 7348.05ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 76.0MB in the beginning and 148.6MB in the end (delta: -72.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,050 INFO L158 Benchmark]: Witness Printer took 64.56ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 138.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 13:45:52,051 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.17ms. Allocated memory is still 113.2MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.01ms. Allocated memory is still 113.2MB. Free memory was 87.5MB in the beginning and 89.5MB in the end (delta: -1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.66ms. Allocated memory is still 113.2MB. Free memory was 89.5MB in the beginning and 87.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.96ms. Allocated memory is still 113.2MB. Free memory was 87.8MB in the beginning and 86.8MB in the end (delta: 959.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 205.11ms. Allocated memory is still 113.2MB. Free memory was 86.5MB in the beginning and 76.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7348.05ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 76.0MB in the beginning and 148.6MB in the end (delta: -72.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 64.56ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 138.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [a=1048576, b=1048576, counter=0, p=1, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=1048576, b=1048576, counter=1, counter++=0, p=1, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1048576, b=1048576, counter=1, p=1, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1048576, b=1048576, counter=1, p=1, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=524288, b=524288, counter=1, p=4, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=524288, b=524288, counter=2, counter++=1, p=4, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=524288, b=524288, counter=2, p=4, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=524288, b=524288, counter=2, p=4, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=262144, b=262144, counter=2, p=16, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=262144, b=262144, counter=3, counter++=2, p=16, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=262144, b=262144, counter=3, p=16, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=262144, b=262144, counter=3, p=16, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=131072, b=131072, counter=3, p=64, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=131072, b=131072, counter=4, counter++=3, p=64, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=131072, b=131072, counter=4, p=64, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=131072, b=131072, counter=4, p=64, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=65536, b=65536, counter=4, p=256, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=65536, b=65536, counter=5, counter++=4, p=256, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=65536, b=65536, counter=5, p=256, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=65536, b=65536, counter=5, p=256, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32768, b=32768, counter=5, p=1024, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=32768, b=32768, counter=6, counter++=5, p=1024, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32768, b=32768, counter=6, p=1024, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32768, b=32768, counter=6, p=1024, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16384, b=16384, counter=6, p=4096, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=16384, b=16384, counter=7, counter++=6, p=4096, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16384, b=16384, counter=7, p=4096, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16384, b=16384, counter=7, p=4096, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8192, b=8192, counter=7, p=16384, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=8192, b=8192, counter=8, counter++=7, p=16384, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8192, b=8192, counter=8, p=16384, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8192, b=8192, counter=8, p=16384, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4096, b=4096, counter=8, p=65536, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=4096, b=4096, counter=9, counter++=8, p=65536, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4096, b=4096, counter=9, p=65536, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4096, b=4096, counter=9, p=65536, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2048, b=2048, counter=9, p=262144, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=2048, b=2048, counter=10, counter++=9, p=262144, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2048, b=2048, counter=10, p=262144, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2048, b=2048, counter=10, p=262144, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1024, b=1024, counter=10, p=1048576, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=1024, b=1024, counter=11, counter++=10, p=1048576, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1024, b=1024, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1024, b=1024, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=512, b=512, counter=11, p=4194304, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=512, b=512, counter=12, counter++=11, p=4194304, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=512, b=512, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=512, b=512, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=256, b=256, counter=12, p=16777216, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=256, b=256, counter=13, counter++=12, p=16777216, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=256, b=256, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=256, b=256, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=128, b=128, counter=13, p=67108864, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=128, b=128, counter=14, counter++=13, p=67108864, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=128, b=128, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=128, b=128, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=64, b=64, counter=14, p=268435456, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=64, b=64, counter=15, counter++=14, p=268435456, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=64, b=64, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=64, b=64, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32, b=32, counter=15, p=1073741824, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=32, b=32, counter=16, counter++=15, p=1073741824, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32, b=32, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32, b=32, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16, b=16, counter=16, p=4294967296, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=16, b=16, counter=17, counter++=16, p=4294967296, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16, b=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16, b=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8, b=8, counter=17, p=17179869184, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=8, b=8, counter=18, counter++=17, p=17179869184, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8, b=8, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8, b=8, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4, b=4, counter=18, p=68719476736, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=4, b=4, counter=19, counter++=18, p=68719476736, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4, b=4, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4, b=4, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2, b=2, counter=19, p=274877906944, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=2, b=2, counter=20, counter++=19, p=274877906944, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2, b=2, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2, b=2, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1, b=1, counter=20, p=1099511627776, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=1, b=1, counter=21, counter++=20, p=1099511627776, q=0, x=1048576, y=1048576] [L33] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 868 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 1210 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 936 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 274 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 431 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 529 ConstructedInterpolants, 0 QuantifiedInterpolants, 1806 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 343/1126 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 13:45:52,082 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