./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/hard-ll_unwindbound2.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 a74f29702f111ed73ba2cd9dfef16b5785bcb6a565ff8c65e98f4116fd8b0956 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:39,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:39,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:39,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:39,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:39,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:39,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:39,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:39,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:39,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:39,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:39,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:39,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:39,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:39,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:39,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:39,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:39,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:39,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:39,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:39,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:39,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:39,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:39,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:39,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:39,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:39,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:39,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:39,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:39,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:39,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:39,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:39,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:39,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:39,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:39,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:39,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:39,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:39,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:39,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:39,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:39,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:29:39,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:39,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:39,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:39,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:39,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:39,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:39,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:39,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:39,441 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:39,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:39,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:39,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:39,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:39,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:39,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:39,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:39,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:39,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:39,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:39,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:39,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:39,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:39,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:39,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:39,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:39,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:39,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:39,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:39,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:39,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:39,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:39,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:39,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:39,446 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 -> a74f29702f111ed73ba2cd9dfef16b5785bcb6a565ff8c65e98f4116fd8b0956 [2022-02-20 17:29:39,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:39,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:39,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:39,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:39,711 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:39,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c [2022-02-20 17:29:39,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0edc76483/65107a28b0284ba0a1b12c50ee852fc6/FLAGf0669f1a3 [2022-02-20 17:29:40,169 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:40,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c [2022-02-20 17:29:40,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0edc76483/65107a28b0284ba0a1b12c50ee852fc6/FLAGf0669f1a3 [2022-02-20 17:29:40,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0edc76483/65107a28b0284ba0a1b12c50ee852fc6 [2022-02-20 17:29:40,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:40,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:40,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:40,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:40,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:40,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25151602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40, skipping insertion in model container [2022-02-20 17:29:40,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:40,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:40,364 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/hard-ll_unwindbound2.c[538,551] [2022-02-20 17:29:40,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:40,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:40,396 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/hard-ll_unwindbound2.c[538,551] [2022-02-20 17:29:40,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:40,414 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:40,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40 WrapperNode [2022-02-20 17:29:40,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:40,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:40,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:40,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:40,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,444 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:29:40,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:40,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:40,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:40,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:40,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:40,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:40,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:40,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:40,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (1/1) ... [2022-02-20 17:29:40,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:40,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:40,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:29:40,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:29:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:40,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:40,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:40,574 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:40,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:40,764 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:40,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:40,777 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:29:40,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:40 BoogieIcfgContainer [2022-02-20 17:29:40,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:40,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:40,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:40,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:40,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:40" (1/3) ... [2022-02-20 17:29:40,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1676e5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:40, skipping insertion in model container [2022-02-20 17:29:40,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:40" (2/3) ... [2022-02-20 17:29:40,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1676e5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:40, skipping insertion in model container [2022-02-20 17:29:40,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:40" (3/3) ... [2022-02-20 17:29:40,800 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound2.c [2022-02-20 17:29:40,804 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:40,805 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:40,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:40,878 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 [2022-02-20 17:29:40,881 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:29:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:29:40,917 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:40,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:40,919 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:29:40,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:40,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872205365] [2022-02-20 17:29:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:41,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31#true} is VALID [2022-02-20 17:29:41,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31#true} is VALID [2022-02-20 17:29:41,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {32#false} is VALID [2022-02-20 17:29:41,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {32#false} is VALID [2022-02-20 17:29:41,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:29:41,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:29:41,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {32#false} is VALID [2022-02-20 17:29:41,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:29:41,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:29:41,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:29:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:41,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:41,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872205365] [2022-02-20 17:29:41,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872205365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:41,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:41,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:41,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104069813] [2022-02-20 17:29:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2022-02-20 17:29:41,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:41,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:29:41,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:41,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:41,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:41,169 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:29:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,233 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:29:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:41,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2022-02-20 17:29:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:29:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:29:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:29:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:29:41,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:29:41,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:41,387 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:29:41,387 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:29:41,390 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 [2022-02-20 17:29:41,396 INFO L933 BasicCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:41,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:29:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:29:41,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:41,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,430 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,430 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,439 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:29:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:41,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:41,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:41,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:29:41,442 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:29:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,452 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:29:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:41,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:41,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:41,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:41,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:29:41,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:29:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:41,460 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:29:41,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:29:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:29:41,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:41,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:41,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:41,463 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:29:41,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:41,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381163874] [2022-02-20 17:29:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:41,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189#true} is VALID [2022-02-20 17:29:41,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {189#true} is VALID [2022-02-20 17:29:41,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume !(0 == assume_abort_if_not_~cond#1); {189#true} is VALID [2022-02-20 17:29:41,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {189#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:29:41,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:29:41,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:29:41,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:41,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:29:41,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-02-20 17:29:41,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-02-20 17:29:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:41,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:41,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381163874] [2022-02-20 17:29:41,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381163874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:41,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:41,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:41,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428194122] [2022-02-20 17:29:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:41,559 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 [2022-02-20 17:29:41,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:41,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:29:41,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:41,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:41,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:41,570 INFO L87 Difference]: Start difference. First operand 24 states and 34 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) [2022-02-20 17:29:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,705 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:29:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:41,706 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 [2022-02-20 17:29:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:29:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:29:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:41,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:29:41,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:41,764 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:29:41,764 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:29:41,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:41,766 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:41,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:29:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:29:41,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:41,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,771 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,772 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,774 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:29:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:29:41,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:41,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:41,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:29:41,776 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:29:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,778 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:29:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:29:41,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:41,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:41,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:41,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:29:41,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:29:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:41,782 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:29:41,782 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) [2022-02-20 17:29:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:29:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:29:41,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:41,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:41,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:29:41,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:29:41,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:41,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284731535] [2022-02-20 17:29:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:41,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:29:41,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:29:41,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {362#(= ~counter~0 0)} is VALID [2022-02-20 17:29:41,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:29:41,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:29:41,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {361#false} is VALID [2022-02-20 17:29:41,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {361#false} is VALID [2022-02-20 17:29:41,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#false} assume !(main_#t~post7#1 < 2);havoc main_#t~post7#1; {361#false} is VALID [2022-02-20 17:29:41,821 INFO L272 TraceCheckUtils]: 8: Hoare triple {361#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {361#false} is VALID [2022-02-20 17:29:41,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-02-20 17:29:41,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-02-20 17:29:41,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 17:29:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:41,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:41,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284731535] [2022-02-20 17:29:41,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284731535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:41,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:41,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:41,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101094894] [2022-02-20 17:29:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:41,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:29:41,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:41,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:29:41,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:41,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:41,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:41,835 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:29:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,905 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:29:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:29:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:29:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:29:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:29:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:29:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:29:41,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:29:41,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:41,960 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:29:41,960 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:29:41,960 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 [2022-02-20 17:29:41,961 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:41,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:29:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:29:41,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:41,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,967 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,967 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,969 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:29:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:29:41,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:41,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:41,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:29:41,971 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:29:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:41,972 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:29:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:29:41,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:41,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:41,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:41,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:29:41,975 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:29:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:41,976 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:29:41,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:29:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:29:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:29:41,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:41,977 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:41,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:29:41,977 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:29:41,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:41,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691191570] [2022-02-20 17:29:41,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:29:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:42,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:29:42,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:29:42,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:29:42,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} #74#return; {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:29:42,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {527#true} is VALID [2022-02-20 17:29:42,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {527#true} is VALID [2022-02-20 17:29:42,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond#1); {527#true} is VALID [2022-02-20 17:29:42,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:29:42,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:29:42,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:29:42,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {527#true} is VALID [2022-02-20 17:29:42,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:29:42,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:29:42,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:29:42,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {527#true} {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} #74#return; {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:29:42,061 INFO L272 TraceCheckUtils]: 11: Hoare triple {529#(= (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:42,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:29:42,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:29:42,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:29:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:42,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:42,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691191570] [2022-02-20 17:29:42,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691191570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:42,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:42,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:42,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976568859] [2022-02-20 17:29:42,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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 15 [2022-02-20 17:29:42,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:42,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:29:42,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:42,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:42,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:42,080 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:29:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:42,245 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:29:42,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:42,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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 15 [2022-02-20 17:29:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:29:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:29:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:42,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:29:42,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:42,313 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:29:42,313 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:29:42,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:42,315 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:42,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:29:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:29:42,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:42,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:42,321 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:42,321 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:42,323 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:29:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:29:42,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:42,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:42,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:29:42,325 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:29:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:42,327 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:29:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:29:42,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:42,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:42,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:42,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:29:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:29:42,330 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:29:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:42,331 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:29:42,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:29:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:29:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:29:42,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:42,332 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:42,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:29:42,332 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:29:42,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:42,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26187581] [2022-02-20 17:29:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:42,350 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:42,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842274857] [2022-02-20 17:29:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:42,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:42,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:29:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:42,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 17:29:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:42,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:43,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {730#true} is VALID [2022-02-20 17:29:43,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {738#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:29:43,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {742#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} is VALID [2022-02-20 17:29:43,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {742#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:29:43,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:29:43,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:29:43,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:29:43,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} ~cond := #in~cond; {759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:43,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:43,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:43,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {763#(not (= |__VERIFIER_assert_#in~cond| 0))} {746#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~q~0#1| 0))} #74#return; {770#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)))} is VALID [2022-02-20 17:29:43,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {770#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {730#true} is VALID [2022-02-20 17:29:43,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:29:43,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:29:43,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:29:43,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {730#true} {770#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)))} #76#return; {770#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)))} is VALID [2022-02-20 17:29:43,133 INFO L272 TraceCheckUtils]: 16: Hoare triple {770#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 % 4294967296 * main_~p~0#1 then 1 else 0)); {789#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:43,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {793#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:43,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {793#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:29:43,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:29:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:29:43,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:51,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:29:51,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {793#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:29:51,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {793#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:51,674 INFO L272 TraceCheckUtils]: 16: Hoare triple {809#(= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 % 4294967296 * main_~p~0#1 then 1 else 0)); {789#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:51,675 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {730#true} {809#(= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|)} #76#return; {809#(= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:29:51,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:29:51,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:29:51,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:29:51,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {809#(= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {730#true} is VALID [2022-02-20 17:29:51,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {763#(not (= |__VERIFIER_assert_#in~cond| 0))} {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} #74#return; {809#(= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:29:51,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:51,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:51,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} ~cond := #in~cond; {838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:29:51,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:29:51,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} is VALID [2022-02-20 17:29:51,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} is VALID [2022-02-20 17:29:51,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {828#(or (= (* |ULTIMATE.start_main_~p~0#1| (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) |ULTIMATE.start_main_~d~0#1|) (not (= |ULTIMATE.start_main_~q~0#1| 0)))} is VALID [2022-02-20 17:29:51,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(0 == assume_abort_if_not_~cond#1); {730#true} is VALID [2022-02-20 17:29:51,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {730#true} is VALID [2022-02-20 17:29:51,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {730#true} is VALID [2022-02-20 17:29:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:29:51,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:51,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26187581] [2022-02-20 17:29:51,685 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:51,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842274857] [2022-02-20 17:29:51,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842274857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:51,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:51,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-02-20 17:29:51,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485458336] [2022-02-20 17:29:51,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2022-02-20 17:29:51,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:51,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:51,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:51,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:29:51,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:29:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:29:51,727 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:52,935 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-02-20 17:29:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:29:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2022-02-20 17:29:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-02-20 17:29:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-02-20 17:29:52,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-02-20 17:29:53,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:53,043 INFO L225 Difference]: With dead ends: 75 [2022-02-20 17:29:53,043 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:29:53,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:29:53,044 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 72 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:53,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 123 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:29:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:29:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-02-20 17:29:53,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:53,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,073 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,074 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:53,077 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-02-20 17:29:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-02-20 17:29:53,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:53,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:53,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 59 states. [2022-02-20 17:29:53,080 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 59 states. [2022-02-20 17:29:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:53,084 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-02-20 17:29:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-02-20 17:29:53,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:53,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:53,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:53,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-02-20 17:29:53,088 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 20 [2022-02-20 17:29:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:53,089 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-02-20 17:29:53,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-02-20 17:29:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:29:53,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:53,090 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:53,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:29:53,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:53,312 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:29:53,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:53,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324987631] [2022-02-20 17:29:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:53,329 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:53,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277530040] [2022-02-20 17:29:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:53,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:53,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:53,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:29:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:53,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:29:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:53,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:53,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {1175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1180#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:53,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1180#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1180#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:53,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1180#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1180#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:53,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {1180#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {1180#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:53,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {1180#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {1193#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= ~counter~0 1)} ~cond := #in~cond; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {1193#(<= ~counter~0 1)} assume !(0 == ~cond); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(<= ~counter~0 1)} assume true; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1193#(<= ~counter~0 1)} {1193#(<= ~counter~0 1)} #74#return; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {1193#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#(<= ~counter~0 1)} ~cond := #in~cond; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1193#(<= ~counter~0 1)} assume !(0 == ~cond); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {1193#(<= ~counter~0 1)} assume true; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1193#(<= ~counter~0 1)} {1193#(<= ~counter~0 1)} #76#return; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,568 INFO L272 TraceCheckUtils]: 16: Hoare triple {1193#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 % 4294967296 * main_~p~0#1 then 1 else 0)); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#(<= ~counter~0 1)} ~cond := #in~cond; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {1193#(<= ~counter~0 1)} assume !(0 == ~cond); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {1193#(<= ~counter~0 1)} assume true; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,570 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1193#(<= ~counter~0 1)} {1193#(<= ~counter~0 1)} #78#return; {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {1193#(<= ~counter~0 1)} assume !(main_~r~0#1 >= main_~d~0#1); {1193#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:53,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {1193#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1248#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:29:53,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1248#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 2);havoc main_#t~post7#1; {1176#false} is VALID [2022-02-20 17:29:53,572 INFO L272 TraceCheckUtils]: 24: Hoare triple {1176#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {1176#false} is VALID [2022-02-20 17:29:53,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-02-20 17:29:53,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-02-20 17:29:53,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-02-20 17:29:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:29:53,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:53,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:53,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324987631] [2022-02-20 17:29:53,573 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:53,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277530040] [2022-02-20 17:29:53,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277530040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:53,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:53,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:29:53,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744576765] [2022-02-20 17:29:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:29:53,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:53,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:53,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:53,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:53,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:53,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:53,595 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:53,833 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-02-20 17:29:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:29:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:29:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:29:53,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 17:29:53,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:53,894 INFO L225 Difference]: With dead ends: 72 [2022-02-20 17:29:53,894 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 17:29:53,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:53,895 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:53,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 17:29:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-02-20 17:29:53,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:53,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,927 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,927 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:53,930 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 17:29:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 17:29:53,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:53,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:53,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-02-20 17:29:53,931 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-02-20 17:29:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:53,934 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 17:29:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 17:29:53,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:53,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:53,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:53,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:29:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-02-20 17:29:53,937 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 28 [2022-02-20 17:29:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:53,938 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-02-20 17:29:53,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-02-20 17:29:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:29:53,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:53,939 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:54,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:54,159 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,SelfDestructingSolverStorable5 [2022-02-20 17:29:54,160 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-02-20 17:29:54,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:54,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141311100] [2022-02-20 17:29:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:54,177 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:54,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854286386] [2022-02-20 17:29:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:54,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:54,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:54,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:54,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:29:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:54,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:29:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:54,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:54,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {1580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1580#true} is VALID [2022-02-20 17:29:54,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1580#true} is VALID [2022-02-20 17:29:54,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume !(0 == assume_abort_if_not_~cond#1); {1580#true} is VALID [2022-02-20 17:29:54,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {1580#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1580#true} is VALID [2022-02-20 17:29:54,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-02-20 17:29:54,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-02-20 17:29:54,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-02-20 17:29:54,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1580#true} {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} #74#return; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,403 INFO L272 TraceCheckUtils]: 11: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {1580#true} is VALID [2022-02-20 17:29:54,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-02-20 17:29:54,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-02-20 17:29:54,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-02-20 17:29:54,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1580#true} {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} #76#return; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,404 INFO L272 TraceCheckUtils]: 16: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 % 4294967296 * main_~p~0#1 then 1 else 0)); {1580#true} is VALID [2022-02-20 17:29:54,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-02-20 17:29:54,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-02-20 17:29:54,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-02-20 17:29:54,405 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1580#true} {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} #78#return; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} assume !(main_~r~0#1 >= main_~d~0#1); {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} assume !!(main_#t~post7#1 < 2);havoc main_#t~post7#1; {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:29:54,407 INFO L272 TraceCheckUtils]: 24: Hoare triple {1594#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == main_~q~0#1 * (main_~B~0#1 % 4294967296) + main_~r~0#1 then 1 else 0)); {1658#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:54,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {1658#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1662#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:54,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {1662#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-02-20 17:29:54,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-02-20 17:29:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:29:54,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:54,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:54,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141311100] [2022-02-20 17:29:54,409 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:54,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854286386] [2022-02-20 17:29:54,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854286386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:54,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:54,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:54,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160428538] [2022-02-20 17:29:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:54,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:29:54,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:54,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:54,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:54,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:54,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:54,430 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:54,686 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-02-20 17:29:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:29:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:29:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:29:54,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:29:54,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:54,740 INFO L225 Difference]: With dead ends: 79 [2022-02-20 17:29:54,740 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:29:54,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:54,741 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:54,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 94 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:29:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-02-20 17:29:54,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:54,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:54,772 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:54,772 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:54,775 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-02-20 17:29:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-02-20 17:29:54,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:54,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:54,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:29:54,776 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:29:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:54,778 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-02-20 17:29:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-02-20 17:29:54,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:54,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:54,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:54,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.2) internal successors, (54), 49 states have internal predecessors, (54), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-02-20 17:29:54,781 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 28 [2022-02-20 17:29:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:54,782 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-02-20 17:29:54,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:29:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-02-20 17:29:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:29:54,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:54,783 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:54,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:55,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:55,005 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1091220578, now seen corresponding path program 1 times [2022-02-20 17:29:55,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:55,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752410422] [2022-02-20 17:29:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:55,026 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:55,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400176968] [2022-02-20 17:29:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:55,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:55,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:55,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:29:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:55,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:29:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:55,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:55,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {2017#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {2022#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {2022#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {2022#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {2022#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {2035#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {2035#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#(<= ~counter~0 1)} ~cond := #in~cond; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {2035#(<= ~counter~0 1)} assume !(0 == ~cond); {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {2035#(<= ~counter~0 1)} assume true; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2035#(<= ~counter~0 1)} {2035#(<= ~counter~0 1)} #74#return; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {2035#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2035#(<= ~counter~0 1)} ~cond := #in~cond; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2035#(<= ~counter~0 1)} assume !(0 == ~cond); {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {2035#(<= ~counter~0 1)} assume true; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,259 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2035#(<= ~counter~0 1)} {2035#(<= ~counter~0 1)} #76#return; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,260 INFO L272 TraceCheckUtils]: 16: Hoare triple {2035#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 % 4294967296 * main_~p~0#1 then 1 else 0)); {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {2035#(<= ~counter~0 1)} ~cond := #in~cond; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {2035#(<= ~counter~0 1)} assume !(0 == ~cond); {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {2035#(<= ~counter~0 1)} assume true; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,262 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2035#(<= ~counter~0 1)} {2035#(<= ~counter~0 1)} #78#return; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {2035#(<= ~counter~0 1)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {2035#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2090#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:29:55,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {2090#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {2018#false} is VALID [2022-02-20 17:29:55,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {2018#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {2018#false} is VALID [2022-02-20 17:29:55,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {2018#false} assume !(main_#t~post7#1 < 2);havoc main_#t~post7#1; {2018#false} is VALID [2022-02-20 17:29:55,263 INFO L272 TraceCheckUtils]: 26: Hoare triple {2018#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {2018#false} is VALID [2022-02-20 17:29:55,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2022-02-20 17:29:55,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#false} assume !(0 == ~cond); {2018#false} is VALID [2022-02-20 17:29:55,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#false} assume true; {2018#false} is VALID [2022-02-20 17:29:55,264 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2018#false} {2018#false} #84#return; {2018#false} is VALID [2022-02-20 17:29:55,264 INFO L272 TraceCheckUtils]: 31: Hoare triple {2018#false} call __VERIFIER_assert((if main_~B~0#1 % 4294967296 == main_~d~0#1 then 1 else 0)); {2018#false} is VALID [2022-02-20 17:29:55,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2022-02-20 17:29:55,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#false} assume 0 == ~cond; {2018#false} is VALID [2022-02-20 17:29:55,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-02-20 17:29:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:29:55,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:55,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-02-20 17:29:55,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#false} assume 0 == ~cond; {2018#false} is VALID [2022-02-20 17:29:55,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2022-02-20 17:29:55,399 INFO L272 TraceCheckUtils]: 31: Hoare triple {2018#false} call __VERIFIER_assert((if main_~B~0#1 % 4294967296 == main_~d~0#1 then 1 else 0)); {2018#false} is VALID [2022-02-20 17:29:55,400 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2017#true} {2018#false} #84#return; {2018#false} is VALID [2022-02-20 17:29:55,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-02-20 17:29:55,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-02-20 17:29:55,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-02-20 17:29:55,400 INFO L272 TraceCheckUtils]: 26: Hoare triple {2018#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {2017#true} is VALID [2022-02-20 17:29:55,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {2018#false} assume !(main_#t~post7#1 < 2);havoc main_#t~post7#1; {2018#false} is VALID [2022-02-20 17:29:55,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {2018#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {2018#false} is VALID [2022-02-20 17:29:55,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {2090#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {2018#false} is VALID [2022-02-20 17:29:55,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {2035#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2090#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:29:55,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {2035#(<= ~counter~0 1)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,402 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2017#true} {2035#(<= ~counter~0 1)} #78#return; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-02-20 17:29:55,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-02-20 17:29:55,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-02-20 17:29:55,403 INFO L272 TraceCheckUtils]: 16: Hoare triple {2035#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 % 4294967296 * main_~p~0#1 then 1 else 0)); {2017#true} is VALID [2022-02-20 17:29:55,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2035#(<= ~counter~0 1)} #76#return; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-02-20 17:29:55,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-02-20 17:29:55,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-02-20 17:29:55,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {2035#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 % 4294967296 then 1 else 0)); {2017#true} is VALID [2022-02-20 17:29:55,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2035#(<= ~counter~0 1)} #74#return; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-02-20 17:29:55,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-02-20 17:29:55,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-02-20 17:29:55,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {2035#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2017#true} is VALID [2022-02-20 17:29:55,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {2035#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {2022#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2035#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:55,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {2022#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1 % 4294967296;main_~d~0#1 := main_~B~0#1 % 4294967296;main_~p~0#1 := 1;main_~q~0#1 := 0; {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2022#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {2022#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {2017#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2022#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:29:55,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:55,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752410422] [2022-02-20 17:29:55,412 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:55,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400176968] [2022-02-20 17:29:55,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400176968] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:55,412 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:55,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2022-02-20 17:29:55,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921771698] [2022-02-20 17:29:55,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 35 [2022-02-20 17:29:55,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:55,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:29:55,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:55,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:55,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:55,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:55,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:55,444 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:29:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:55,660 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2022-02-20 17:29:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:55,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 35 [2022-02-20 17:29:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:29:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 17:29:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:29:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 17:29:55,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-02-20 17:29:55,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:55,730 INFO L225 Difference]: With dead ends: 106 [2022-02-20 17:29:55,730 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 17:29:55,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:55,731 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:55,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 17:29:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-20 17:29:55,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:55,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 51 states have internal predecessors, (56), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:55,765 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 51 states have internal predecessors, (56), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:55,765 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 51 states have internal predecessors, (56), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:55,768 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-02-20 17:29:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:29:55,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:55,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:55,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 51 states have internal predecessors, (56), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 72 states. [2022-02-20 17:29:55,769 INFO L87 Difference]: Start difference. First operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 51 states have internal predecessors, (56), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 72 states. [2022-02-20 17:29:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:55,772 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-02-20 17:29:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:29:55,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:55,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:55,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:55,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 51 states have internal predecessors, (56), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-02-20 17:29:55,775 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-02-20 17:29:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:55,776 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-02-20 17:29:55,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:29:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:29:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:29:55,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:55,777 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:55,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:56,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:56,006 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash -785132454, now seen corresponding path program 1 times [2022-02-20 17:29:56,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:56,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410132010] [2022-02-20 17:29:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:56,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:56,025 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:56,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226150430] [2022-02-20 17:29:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:56,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:56,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:56,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:29:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:56,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:56,111 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:29:56,111 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:56,112 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:56,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:56,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:56,330 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:56,333 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:56,349 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); [2022-02-20 17:29:56,349 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:29:56,352 INFO L158 Benchmark]: Toolchain (without parser) took 16146.85ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 46.9MB in the beginning and 76.9MB in the end (delta: -30.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 17:29:56,352 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 86.0MB. Free memory was 63.2MB in the beginning and 63.1MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:56,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.05ms. Allocated memory is still 86.0MB. Free memory was 46.7MB in the beginning and 62.0MB in the end (delta: -15.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-02-20 17:29:56,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 60.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:56,359 INFO L158 Benchmark]: Boogie Preprocessor took 16.53ms. Allocated memory is still 86.0MB. Free memory was 60.3MB in the beginning and 59.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:56,359 INFO L158 Benchmark]: RCFGBuilder took 316.50ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 48.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:56,359 INFO L158 Benchmark]: TraceAbstraction took 15570.81ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 47.8MB in the beginning and 76.9MB in the end (delta: -29.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-02-20 17:29:56,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.72ms. Allocated memory is still 86.0MB. Free memory was 63.2MB in the beginning and 63.1MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.05ms. Allocated memory is still 86.0MB. Free memory was 46.7MB in the beginning and 62.0MB in the end (delta: -15.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 60.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.53ms. Allocated memory is still 86.0MB. Free memory was 60.3MB in the beginning and 59.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.50ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 48.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15570.81ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 47.8MB in the beginning and 76.9MB in the end (delta: -29.1MB). Peak memory consumption was 11.9MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:29:56,388 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/hard-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a74f29702f111ed73ba2cd9dfef16b5785bcb6a565ff8c65e98f4116fd8b0956 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:58,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:58,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:58,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:58,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:58,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:58,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:58,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:58,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:58,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:58,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:58,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:58,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:58,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:58,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:58,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:58,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:58,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:58,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:58,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:58,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:58,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:58,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:58,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:58,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:58,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:58,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:58,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:58,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:58,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:58,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:58,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:58,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:58,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:58,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:58,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:58,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:58,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:58,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:58,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:58,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:58,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:29:58,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:58,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:58,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:58,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:58,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:58,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:58,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:58,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:58,254 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:58,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:58,255 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:58,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:58,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:58,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:58,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:58,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:58,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:58,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:58,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:58,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:58,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:58,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:58,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:58,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:58,262 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:29:58,262 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:29:58,262 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:58,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:58,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:58,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:29:58,263 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a74f29702f111ed73ba2cd9dfef16b5785bcb6a565ff8c65e98f4116fd8b0956 [2022-02-20 17:29:58,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:58,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:58,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:58,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:58,581 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:58,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c [2022-02-20 17:29:58,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f509077f/6066e4723a994ce2a65fc3ec5b98427b/FLAG594ce9278 [2022-02-20 17:29:59,057 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:59,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound2.c [2022-02-20 17:29:59,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f509077f/6066e4723a994ce2a65fc3ec5b98427b/FLAG594ce9278 [2022-02-20 17:29:59,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f509077f/6066e4723a994ce2a65fc3ec5b98427b [2022-02-20 17:29:59,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:59,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:59,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:59,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:59,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:59,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e1ce00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59, skipping insertion in model container [2022-02-20 17:29:59,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:59,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:59,609 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/hard-ll_unwindbound2.c[538,551] [2022-02-20 17:29:59,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:59,639 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:59,656 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/hard-ll_unwindbound2.c[538,551] [2022-02-20 17:29:59,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:59,691 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:59,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59 WrapperNode [2022-02-20 17:29:59,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:59,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:59,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:59,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:59,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,724 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:29:59,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:59,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:59,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:59,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:59,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:59,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:59,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:59,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:59,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (1/1) ... [2022-02-20 17:29:59,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:59,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:29:59,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:59,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:59,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:59,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:59,864 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:59,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:30:00,401 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:30:00,409 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:30:00,409 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:30:00,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:30:00 BoogieIcfgContainer [2022-02-20 17:30:00,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:30:00,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:30:00,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:30:00,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:30:00,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:59" (1/3) ... [2022-02-20 17:30:00,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7152e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:30:00, skipping insertion in model container [2022-02-20 17:30:00,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:59" (2/3) ... [2022-02-20 17:30:00,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7152e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:30:00, skipping insertion in model container [2022-02-20 17:30:00,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:30:00" (3/3) ... [2022-02-20 17:30:00,418 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound2.c [2022-02-20 17:30:00,422 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:30:00,422 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:30:00,475 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:30:00,488 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 [2022-02-20 17:30:00,489 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:30:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:30:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:30:00,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:00,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:00,512 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:30:00,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:00,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425845931] [2022-02-20 17:30:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:00,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:00,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:30:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:00,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:30:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:00,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:00,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {31#true} is VALID [2022-02-20 17:30:00,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31#true} is VALID [2022-02-20 17:30:00,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {32#false} is VALID [2022-02-20 17:30:00,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {32#false} is VALID [2022-02-20 17:30:00,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:30:00,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:30:00,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~A~0#1) == ~bvadd64(~bvmul64(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {32#false} is VALID [2022-02-20 17:30:00,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:30:00,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0bv32 == ~cond; {32#false} is VALID [2022-02-20 17:30:00,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:30:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:30:00,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:00,733 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:00,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425845931] [2022-02-20 17:30:00,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425845931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:00,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:00,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:30:00,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843876543] [2022-02-20 17:30:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:00,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2022-02-20 17:30:00,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:00,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:30:00,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:00,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:30:00,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:00,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:30:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:30:00,812 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:30:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:01,530 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:30:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:30:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2022-02-20 17:30:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:30:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:30:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:30:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:30:01,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:30:02,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:02,320 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:30:02,320 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:30:02,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:30:02,325 INFO L933 BasicCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:02,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:30:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:30:02,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:02,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:02,351 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:02,351 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:02,356 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:30:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:30:02,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:02,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:02,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:30:02,357 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:30:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:02,360 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:30:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:30:02,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:02,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:02,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:02,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:30:02,366 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:30:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:02,366 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:30:02,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2022-02-20 17:30:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:30:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:30:02,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:02,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:02,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:02,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:02,582 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:30:02,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:02,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182573038] [2022-02-20 17:30:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:02,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:02,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:02,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:30:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:02,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:30:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:02,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:02,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {216#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {216#true} is VALID [2022-02-20 17:30:02,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {216#true} is VALID [2022-02-20 17:30:02,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {216#true} is VALID [2022-02-20 17:30:02,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {216#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} is VALID [2022-02-20 17:30:02,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} is VALID [2022-02-20 17:30:02,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} is VALID [2022-02-20 17:30:02,701 INFO L272 TraceCheckUtils]: 6: Hoare triple {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {240#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:02,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {244#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:02,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {217#false} is VALID [2022-02-20 17:30:02,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#false} assume !false; {217#false} is VALID [2022-02-20 17:30:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:30:02,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:02,702 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:02,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182573038] [2022-02-20 17:30:02,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182573038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:02,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:02,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:02,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739442] [2022-02-20 17:30:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:02,704 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 [2022-02-20 17:30:02,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:02,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 17:30:02,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:02,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:02,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:02,720 INFO L87 Difference]: Start difference. First operand 24 states and 34 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) [2022-02-20 17:30:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:05,125 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:30:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:05,125 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 [2022-02-20 17:30:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:30:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 17:30:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:05,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:30:05,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:05,775 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:30:05,776 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:30:05,776 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 [2022-02-20 17:30:05,777 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:05,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:30:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:30:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:30:05,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:05,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:05,784 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:05,784 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:05,787 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:30:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:30:05,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:05,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:05,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:30:05,789 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:30:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:05,792 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:30:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:30:05,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:05,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:05,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:05,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:30:05,795 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:30:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:05,795 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:30:05,796 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) [2022-02-20 17:30:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:30:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:30:05,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:05,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:05,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:06,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:06,004 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:30:06,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:06,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954285153] [2022-02-20 17:30:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:06,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:06,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:06,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:30:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:06,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:30:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:06,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:06,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {419#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:06,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {419#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:06,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {419#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:06,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {419#(= ~counter~0 (_ bv0 32))} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {419#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:06,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {432#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:30:06,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {415#false} is VALID [2022-02-20 17:30:06,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {415#false} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {415#false} is VALID [2022-02-20 17:30:06,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#false} assume !~bvslt32(main_#t~post7#1, 2bv32);havoc main_#t~post7#1; {415#false} is VALID [2022-02-20 17:30:06,149 INFO L272 TraceCheckUtils]: 8: Hoare triple {415#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~A~0#1) == ~bvadd64(~bvmul64(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {415#false} is VALID [2022-02-20 17:30:06,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-02-20 17:30:06,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} assume 0bv32 == ~cond; {415#false} is VALID [2022-02-20 17:30:06,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-02-20 17:30:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:30:06,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:06,150 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:06,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954285153] [2022-02-20 17:30:06,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954285153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:06,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:06,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:30:06,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980082356] [2022-02-20 17:30:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:30:06,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:06,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:30:06,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:06,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:30:06,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:30:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:30:06,193 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:30:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:08,035 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:30:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:30:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:30:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:30:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:30:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:30:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:30:08,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:30:08,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:08,568 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:30:08,568 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:30:08,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:30:08,569 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:08,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:30:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:30:08,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:08,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:08,574 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:08,574 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:08,576 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:30:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:08,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:08,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:08,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:30:08,578 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:30:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:08,580 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:30:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:08,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:08,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:08,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:08,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:30:08,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:30:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:08,584 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:30:08,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-20 17:30:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:30:08,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:08,585 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:08,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:08,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:08,791 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:30:08,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:08,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113030600] [2022-02-20 17:30:08,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:08,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:08,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:08,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 17:30:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:08,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:30:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:08,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:08,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {614#true} is VALID [2022-02-20 17:30:08,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {614#true} is VALID [2022-02-20 17:30:08,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {614#true} is VALID [2022-02-20 17:30:08,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {614#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:30:08,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:30:08,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:30:08,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {614#true} is VALID [2022-02-20 17:30:08,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-02-20 17:30:08,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0bv32 == ~cond); {614#true} is VALID [2022-02-20 17:30:08,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-02-20 17:30:08,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} #74#return; {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:30:08,926 INFO L272 TraceCheckUtils]: 11: Hoare triple {628#(= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {653#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:08,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {653#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:08,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {615#false} is VALID [2022-02-20 17:30:08,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-02-20 17:30:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:30:08,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:08,927 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:08,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113030600] [2022-02-20 17:30:08,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113030600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:08,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:08,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:08,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191516717] [2022-02-20 17:30:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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 15 [2022-02-20 17:30:08,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:08,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:30:08,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:08,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:08,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:08,947 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:30:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:11,894 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:30:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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 15 [2022-02-20 17:30:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:30:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:30:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:11,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:30:12,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:12,439 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:30:12,439 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:30:12,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:30:12,440 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:12,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:30:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:30:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:30:12,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:12,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:12,458 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:12,461 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:12,464 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:30:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:30:12,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:12,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:12,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:30:12,465 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:30:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:12,466 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:30:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:30:12,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:12,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:12,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:12,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:30:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:30:12,469 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:30:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:12,469 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:30:12,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) [2022-02-20 17:30:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:30:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:30:12,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:12,471 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:12,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 17:30:12,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:12,679 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:30:12,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:12,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337287919] [2022-02-20 17:30:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:12,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:12,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 17:30:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:12,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:12,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:12,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {855#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {855#true} is VALID [2022-02-20 17:30:12,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {855#true} is VALID [2022-02-20 17:30:12,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {855#true} is VALID [2022-02-20 17:30:12,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {855#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:12,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:12,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:12,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {855#true} is VALID [2022-02-20 17:30:12,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#true} ~cond := #in~cond; {855#true} is VALID [2022-02-20 17:30:12,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {855#true} assume !(0bv32 == ~cond); {855#true} is VALID [2022-02-20 17:30:12,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#true} assume true; {855#true} is VALID [2022-02-20 17:30:12,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {855#true} {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} #74#return; {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:12,890 INFO L272 TraceCheckUtils]: 11: Hoare triple {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {855#true} is VALID [2022-02-20 17:30:12,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#true} ~cond := #in~cond; {855#true} is VALID [2022-02-20 17:30:12,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {855#true} assume !(0bv32 == ~cond); {855#true} is VALID [2022-02-20 17:30:12,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#true} assume true; {855#true} is VALID [2022-02-20 17:30:12,891 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {855#true} {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} #76#return; {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:12,892 INFO L272 TraceCheckUtils]: 16: Hoare triple {869#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {909#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:12,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {909#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:12,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {856#false} is VALID [2022-02-20 17:30:12,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-02-20 17:30:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:30:12,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:12,894 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:12,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337287919] [2022-02-20 17:30:12,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337287919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:12,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:12,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:12,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555181401] [2022-02-20 17:30:12,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:30:12,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:12,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:30:12,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:12,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:12,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:12,937 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:30:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:17,335 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-02-20 17:30:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:30:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:30:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-02-20 17:30:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:30:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-02-20 17:30:17,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-02-20 17:30:18,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:18,220 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:30:18,220 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:30:18,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:30:18,221 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:18,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:30:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:30:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:30:18,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:18,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:18,227 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:18,228 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:18,230 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:30:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:30:18,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:18,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:18,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-02-20 17:30:18,232 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-02-20 17:30:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:18,234 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:30:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:30:18,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:18,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:18,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:18,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-02-20 17:30:18,238 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2022-02-20 17:30:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:18,239 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-02-20 17:30:18,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:30:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:30:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:30:18,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:18,240 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:18,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:18,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:18,449 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:30:18,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:18,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365631821] [2022-02-20 17:30:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:18,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:18,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:18,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 17:30:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:18,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:18,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:18,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {1172#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1177#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:18,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1177#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:18,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {1177#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:18,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {1177#(= ~counter~0 (_ bv0 32))} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {1177#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:18,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {1177#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume true; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,669 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1190#(= ~counter~0 (_ bv1 32))} {1190#(= ~counter~0 (_ bv1 32))} #74#return; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume true; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,671 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1190#(= ~counter~0 (_ bv1 32))} {1190#(= ~counter~0 (_ bv1 32))} #76#return; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,672 INFO L272 TraceCheckUtils]: 16: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume true; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,675 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1190#(= ~counter~0 (_ bv1 32))} {1190#(= ~counter~0 (_ bv1 32))} #78#return; {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} assume !~bvsge64(main_~r~0#1, main_~d~0#1); {1190#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:18,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {1190#(= ~counter~0 (_ bv1 32))} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {1245#(= |ULTIMATE.start_main_#t~post7#1| (_ bv1 32))} is VALID [2022-02-20 17:30:18,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {1245#(= |ULTIMATE.start_main_#t~post7#1| (_ bv1 32))} assume !~bvslt32(main_#t~post7#1, 2bv32);havoc main_#t~post7#1; {1173#false} is VALID [2022-02-20 17:30:18,676 INFO L272 TraceCheckUtils]: 24: Hoare triple {1173#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~A~0#1) == ~bvadd64(~bvmul64(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1173#false} is VALID [2022-02-20 17:30:18,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {1173#false} ~cond := #in~cond; {1173#false} is VALID [2022-02-20 17:30:18,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {1173#false} assume 0bv32 == ~cond; {1173#false} is VALID [2022-02-20 17:30:18,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {1173#false} assume !false; {1173#false} is VALID [2022-02-20 17:30:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:30:18,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:18,677 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:18,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365631821] [2022-02-20 17:30:18,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365631821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:18,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:18,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:30:18,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095379646] [2022-02-20 17:30:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:18,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:30:18,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:18,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:18,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:18,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:18,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:18,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:18,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:18,746 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:21,611 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-02-20 17:30:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:30:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:30:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:30:21,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 17:30:21,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:21,968 INFO L225 Difference]: With dead ends: 68 [2022-02-20 17:30:21,968 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 17:30:21,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:21,969 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:21,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:30:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 17:30:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-02-20 17:30:21,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:21,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:21,976 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:21,976 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:21,980 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-02-20 17:30:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-02-20 17:30:21,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:21,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:21,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:30:21,982 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:30:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:21,984 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-02-20 17:30:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-02-20 17:30:21,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:21,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:21,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:21,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-02-20 17:30:21,988 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 28 [2022-02-20 17:30:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:21,988 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-02-20 17:30:21,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 17:30:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:30:21,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:21,989 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:22,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:22,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:22,199 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-02-20 17:30:22,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:22,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946013464] [2022-02-20 17:30:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:22,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:22,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 17:30:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:22,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:22,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:22,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {1557#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1557#true} is VALID [2022-02-20 17:30:22,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1557#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1557#true} is VALID [2022-02-20 17:30:22,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1557#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {1557#true} is VALID [2022-02-20 17:30:22,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {1557#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,476 INFO L272 TraceCheckUtils]: 6: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {1557#true} is VALID [2022-02-20 17:30:22,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {1557#true} ~cond := #in~cond; {1557#true} is VALID [2022-02-20 17:30:22,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {1557#true} assume !(0bv32 == ~cond); {1557#true} is VALID [2022-02-20 17:30:22,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {1557#true} assume true; {1557#true} is VALID [2022-02-20 17:30:22,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1557#true} {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #74#return; {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,480 INFO L272 TraceCheckUtils]: 11: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {1557#true} is VALID [2022-02-20 17:30:22,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {1557#true} ~cond := #in~cond; {1557#true} is VALID [2022-02-20 17:30:22,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {1557#true} assume !(0bv32 == ~cond); {1557#true} is VALID [2022-02-20 17:30:22,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {1557#true} assume true; {1557#true} is VALID [2022-02-20 17:30:22,481 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1557#true} {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #76#return; {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,482 INFO L272 TraceCheckUtils]: 16: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {1557#true} is VALID [2022-02-20 17:30:22,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#true} ~cond := #in~cond; {1557#true} is VALID [2022-02-20 17:30:22,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#true} assume !(0bv32 == ~cond); {1557#true} is VALID [2022-02-20 17:30:22,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#true} assume true; {1557#true} is VALID [2022-02-20 17:30:22,485 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1557#true} {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #78#return; {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !~bvsge64(main_~r~0#1, main_~d~0#1); {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post7#1, 2bv32);havoc main_#t~post7#1; {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:22,502 INFO L272 TraceCheckUtils]: 24: Hoare triple {1571#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~A~0#1) == ~bvadd64(~bvmul64(main_~q~0#1, ~zero_extendFrom32To64(main_~B~0#1)), main_~r~0#1) then 1bv32 else 0bv32)); {1635#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:22,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {1635#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1639#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:22,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {1639#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {1558#false} is VALID [2022-02-20 17:30:22,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {1558#false} assume !false; {1558#false} is VALID [2022-02-20 17:30:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:30:22,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:22,504 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:22,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946013464] [2022-02-20 17:30:22,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946013464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:22,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:22,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:22,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821681073] [2022-02-20 17:30:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:22,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:30:22,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:22,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:22,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:22,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:22,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:22,575 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:25,659 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-02-20 17:30:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:30:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:25,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:30:26,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:26,267 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:30:26,267 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 17:30:26,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:30:26,268 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:26,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 94 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:30:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 17:30:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-02-20 17:30:26,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:26,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:26,275 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:26,275 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:26,278 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 17:30:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-02-20 17:30:26,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:26,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:26,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 62 states. [2022-02-20 17:30:26,279 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 62 states. [2022-02-20 17:30:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:26,282 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 17:30:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-02-20 17:30:26,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:26,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:26,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:26,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2022-02-20 17:30:26,285 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 28 [2022-02-20 17:30:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:26,285 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2022-02-20 17:30:26,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:30:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-02-20 17:30:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:30:26,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:26,286 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:26,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 17:30:26,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:26,497 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1091220578, now seen corresponding path program 1 times [2022-02-20 17:30:26,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:26,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135293420] [2022-02-20 17:30:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:26,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:26,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:26,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 17:30:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:26,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:26,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:26,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1960#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:26,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1960#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:26,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {1960#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:26,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {1960#(= ~counter~0 (_ bv0 32))} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {1960#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:26,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {1960#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume true; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1973#(= ~counter~0 (_ bv1 32))} {1973#(= ~counter~0 (_ bv1 32))} #74#return; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume true; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,737 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1973#(= ~counter~0 (_ bv1 32))} {1973#(= ~counter~0 (_ bv1 32))} #76#return; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,738 INFO L272 TraceCheckUtils]: 16: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume true; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,740 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1973#(= ~counter~0 (_ bv1 32))} {1973#(= ~counter~0 (_ bv1 32))} #78#return; {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} assume !!~bvsge64(main_~r~0#1, main_~d~0#1);main_~d~0#1 := ~bvmul64(2bv64, main_~d~0#1);main_~p~0#1 := ~bvmul64(2bv64, main_~p~0#1); {1973#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:26,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {1973#(= ~counter~0 (_ bv1 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2028#(= |ULTIMATE.start_main_#t~post6#1| (_ bv1 32))} is VALID [2022-02-20 17:30:26,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {2028#(= |ULTIMATE.start_main_#t~post6#1| (_ bv1 32))} assume !~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {1956#false} is VALID [2022-02-20 17:30:26,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {1956#false} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {1956#false} is VALID [2022-02-20 17:30:26,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {1956#false} assume !~bvslt32(main_#t~post7#1, 2bv32);havoc main_#t~post7#1; {1956#false} is VALID [2022-02-20 17:30:26,741 INFO L272 TraceCheckUtils]: 26: Hoare triple {1956#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~A~0#1) == ~bvadd64(~bvmul64(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {1956#false} ~cond := #in~cond; {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {1956#false} assume !(0bv32 == ~cond); {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {1956#false} assume true; {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1956#false} {1956#false} #84#return; {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L272 TraceCheckUtils]: 31: Hoare triple {1956#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~B~0#1) == main_~d~0#1 then 1bv32 else 0bv32)); {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {1956#false} ~cond := #in~cond; {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {1956#false} assume 0bv32 == ~cond; {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2022-02-20 17:30:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:30:26,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:30:26,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2022-02-20 17:30:26,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {1956#false} assume 0bv32 == ~cond; {1956#false} is VALID [2022-02-20 17:30:26,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {1956#false} ~cond := #in~cond; {1956#false} is VALID [2022-02-20 17:30:26,908 INFO L272 TraceCheckUtils]: 31: Hoare triple {1956#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~B~0#1) == main_~d~0#1 then 1bv32 else 0bv32)); {1956#false} is VALID [2022-02-20 17:30:26,908 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1955#true} {1956#false} #84#return; {1956#false} is VALID [2022-02-20 17:30:26,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {1955#true} assume true; {1955#true} is VALID [2022-02-20 17:30:26,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {1955#true} assume !(0bv32 == ~cond); {1955#true} is VALID [2022-02-20 17:30:26,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {1955#true} ~cond := #in~cond; {1955#true} is VALID [2022-02-20 17:30:26,909 INFO L272 TraceCheckUtils]: 26: Hoare triple {1956#false} call __VERIFIER_assert((if ~zero_extendFrom32To64(main_~A~0#1) == ~bvadd64(~bvmul64(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1955#true} is VALID [2022-02-20 17:30:26,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {1956#false} assume !~bvslt32(main_#t~post7#1, 2bv32);havoc main_#t~post7#1; {1956#false} is VALID [2022-02-20 17:30:26,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {1956#false} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {1956#false} is VALID [2022-02-20 17:30:26,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {2098#(bvslt |ULTIMATE.start_main_#t~post6#1| (_ bv2 32))} assume !~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {1956#false} is VALID [2022-02-20 17:30:26,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {2102#(bvslt ~counter~0 (_ bv2 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2098#(bvslt |ULTIMATE.start_main_#t~post6#1| (_ bv2 32))} is VALID [2022-02-20 17:30:26,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {2102#(bvslt ~counter~0 (_ bv2 32))} assume !!~bvsge64(main_~r~0#1, main_~d~0#1);main_~d~0#1 := ~bvmul64(2bv64, main_~d~0#1);main_~p~0#1 := ~bvmul64(2bv64, main_~p~0#1); {2102#(bvslt ~counter~0 (_ bv2 32))} is VALID [2022-02-20 17:30:26,911 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1955#true} {2102#(bvslt ~counter~0 (_ bv2 32))} #78#return; {2102#(bvslt ~counter~0 (_ bv2 32))} is VALID [2022-02-20 17:30:26,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {1955#true} assume true; {1955#true} is VALID [2022-02-20 17:30:26,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {1955#true} assume !(0bv32 == ~cond); {1955#true} is VALID [2022-02-20 17:30:26,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1955#true} ~cond := #in~cond; {1955#true} is VALID [2022-02-20 17:30:26,912 INFO L272 TraceCheckUtils]: 16: Hoare triple {2102#(bvslt ~counter~0 (_ bv2 32))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {1955#true} is VALID [2022-02-20 17:30:26,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1955#true} {2102#(bvslt ~counter~0 (_ bv2 32))} #76#return; {2102#(bvslt ~counter~0 (_ bv2 32))} is VALID [2022-02-20 17:30:26,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {1955#true} assume true; {1955#true} is VALID [2022-02-20 17:30:26,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {1955#true} assume !(0bv32 == ~cond); {1955#true} is VALID [2022-02-20 17:30:26,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {1955#true} ~cond := #in~cond; {1955#true} is VALID [2022-02-20 17:30:26,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {2102#(bvslt ~counter~0 (_ bv2 32))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {1955#true} is VALID [2022-02-20 17:30:26,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1955#true} {2102#(bvslt ~counter~0 (_ bv2 32))} #74#return; {2102#(bvslt ~counter~0 (_ bv2 32))} is VALID [2022-02-20 17:30:26,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1955#true} assume true; {1955#true} is VALID [2022-02-20 17:30:26,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {1955#true} assume !(0bv32 == ~cond); {1955#true} is VALID [2022-02-20 17:30:26,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {1955#true} ~cond := #in~cond; {1955#true} is VALID [2022-02-20 17:30:26,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {2102#(bvslt ~counter~0 (_ bv2 32))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {1955#true} is VALID [2022-02-20 17:30:26,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#(bvslt ~counter~0 (_ bv2 32))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {2102#(bvslt ~counter~0 (_ bv2 32))} is VALID [2022-02-20 17:30:26,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2102#(bvslt ~counter~0 (_ bv2 32))} is VALID [2022-02-20 17:30:26,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 17:30:26,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 17:30:26,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 17:30:26,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {2157#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 17:30:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:30:26,917 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:26,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135293420] [2022-02-20 17:30:26,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135293420] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:30:26,918 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:30:26,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:30:26,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006143832] [2022-02-20 17:30:26,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:30:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 35 [2022-02-20 17:30:26,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:26,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:30:27,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:27,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:30:27,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:30:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:30:27,103 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:30:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:31,105 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-02-20 17:30:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:30:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 35 [2022-02-20 17:30:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:30:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 17:30:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:30:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 17:30:31,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-02-20 17:30:31,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:31,710 INFO L225 Difference]: With dead ends: 88 [2022-02-20 17:30:31,710 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 17:30:31,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:30:31,716 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:31,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 149 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:30:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 17:30:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 17:30:31,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:31,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:31,733 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:31,734 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:31,736 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-02-20 17:30:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-02-20 17:30:31,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:31,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:31,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-02-20 17:30:31,737 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-02-20 17:30:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:31,740 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-02-20 17:30:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-02-20 17:30:31,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:31,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:31,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:31,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:30:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-02-20 17:30:31,743 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 35 [2022-02-20 17:30:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:31,743 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-02-20 17:30:31,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:30:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-02-20 17:30:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:30:31,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:31,744 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:31,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:31,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:31,960 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:31,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1884102282, now seen corresponding path program 1 times [2022-02-20 17:30:31,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:31,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724228162] [2022-02-20 17:30:31,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:31,962 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:30:31,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 17:30:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:32,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:30:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:32,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:32,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {2503#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {2503#true} is VALID [2022-02-20 17:30:32,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {2503#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2503#true} is VALID [2022-02-20 17:30:32,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2503#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {2503#true} is VALID [2022-02-20 17:30:32,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {2503#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:32,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:32,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:32,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:32,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:32,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:32,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:32,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2503#true} {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} #74#return; {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:32,335 INFO L272 TraceCheckUtils]: 11: Hoare triple {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:32,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:32,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:32,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:32,336 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2503#true} {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} #76#return; {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:32,336 INFO L272 TraceCheckUtils]: 16: Hoare triple {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:32,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:32,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:32,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:32,337 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2503#true} {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} #78#return; {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:30:32,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {2517#(and (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} assume !!~bvsge64(main_~r~0#1, main_~d~0#1);main_~d~0#1 := ~bvmul64(2bv64, main_~d~0#1);main_~p~0#1 := ~bvmul64(2bv64, main_~p~0#1); {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} is VALID [2022-02-20 17:30:32,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} is VALID [2022-02-20 17:30:32,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} is VALID [2022-02-20 17:30:32,338 INFO L272 TraceCheckUtils]: 24: Hoare triple {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:32,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:32,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:32,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:32,339 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2503#true} {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} #74#return; {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} is VALID [2022-02-20 17:30:32,339 INFO L272 TraceCheckUtils]: 29: Hoare triple {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:32,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:32,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:32,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:32,340 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2503#true} {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} #76#return; {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} is VALID [2022-02-20 17:30:32,340 INFO L272 TraceCheckUtils]: 34: Hoare triple {2572#(and (= |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~d~0#1| (bvmul (_ bv2 64) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {2612#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:32,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {2612#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2616#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:32,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {2616#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {2504#false} is VALID [2022-02-20 17:30:32,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {2504#false} assume !false; {2504#false} is VALID [2022-02-20 17:30:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:30:32,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:30:34,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {2504#false} assume !false; {2504#false} is VALID [2022-02-20 17:30:34,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {2626#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == ~cond; {2504#false} is VALID [2022-02-20 17:30:34,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {2630#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2626#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2022-02-20 17:30:34,580 INFO L272 TraceCheckUtils]: 34: Hoare triple {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {2630#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:30:34,580 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2503#true} {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} #76#return; {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:34,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:34,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:34,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:34,581 INFO L272 TraceCheckUtils]: 29: Hoare triple {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:34,587 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2503#true} {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} #74#return; {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:34,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:34,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:34,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:34,587 INFO L272 TraceCheckUtils]: 24: Hoare triple {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:34,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:34,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,603 WARN L290 TraceCheckUtils]: 21: Hoare triple {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} assume !!~bvsge64(main_~r~0#1, main_~d~0#1);main_~d~0#1 := ~bvmul64(2bv64, main_~d~0#1);main_~p~0#1 := ~bvmul64(2bv64, main_~p~0#1); {2634#(= |ULTIMATE.start_main_~d~0#1| (bvmul |ULTIMATE.start_main_~p~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is UNKNOWN [2022-02-20 17:30:36,604 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2503#true} {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} #78#return; {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:36,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:36,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:36,604 INFO L272 TraceCheckUtils]: 16: Hoare triple {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul64(~zero_extendFrom32To64(main_~B~0#1), main_~p~0#1) then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:36,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2503#true} {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} #76#return; {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:36,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:36,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:36,606 INFO L272 TraceCheckUtils]: 11: Hoare triple {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:36,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2503#true} {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} #74#return; {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {2503#true} assume true; {2503#true} is VALID [2022-02-20 17:30:36,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {2503#true} assume !(0bv32 == ~cond); {2503#true} is VALID [2022-02-20 17:30:36,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2022-02-20 17:30:36,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {2503#true} is VALID [2022-02-20 17:30:36,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} assume !!~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {2503#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := ~zero_extendFrom32To64(main_~A~0#1);main_~d~0#1 := ~zero_extendFrom32To64(main_~B~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {2674#(= (bvmul |ULTIMATE.start_main_~d~0#1| (_ bv2 64)) (bvmul (bvmul |ULTIMATE.start_main_~p~0#1| (_ bv2 64)) ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|)))} is VALID [2022-02-20 17:30:36,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {2503#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {2503#true} is VALID [2022-02-20 17:30:36,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {2503#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvuge32(main_~B~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2503#true} is VALID [2022-02-20 17:30:36,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {2503#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {2503#true} is VALID [2022-02-20 17:30:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:30:36,609 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:36,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724228162] [2022-02-20 17:30:36,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724228162] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:30:36,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:30:36,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-02-20 17:30:36,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586587305] [2022-02-20 17:30:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:36,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-02-20 17:30:36,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:36,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:30:36,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:36,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:30:36,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:30:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:30:36,907 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:30:43,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []