./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.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_unwindbound1.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 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:35,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:35,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:35,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:35,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:35,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:35,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:35,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:35,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:35,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:35,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:35,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:35,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:35,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:35,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:35,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:35,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:35,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:35,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:35,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:35,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:35,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:35,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:35,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:35,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:35,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:35,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:35,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:35,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:35,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:35,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:35,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:35,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:35,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:35,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:35,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:35,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:35,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:35,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:35,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:35,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:35,606 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:35,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:35,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:35,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:35,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:35,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:35,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:35,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:35,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:35,640 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:35,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:35,641 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:35,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:35,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:35,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:35,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:35,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:35,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:35,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:35,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:35,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:35,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:35,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:35,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:35,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:35,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:35,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:35,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:35,645 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 -> 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 [2022-02-20 17:29:35,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:35,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:35,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:35,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:35,844 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:35,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2022-02-20 17:29:35,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8454007/5356735db817412b850229cf5c8d3476/FLAGa4a9335bb [2022-02-20 17:29:36,223 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:36,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2022-02-20 17:29:36,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8454007/5356735db817412b850229cf5c8d3476/FLAGa4a9335bb [2022-02-20 17:29:36,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8454007/5356735db817412b850229cf5c8d3476 [2022-02-20 17:29:36,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:36,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:36,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:36,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:36,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:36,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:36" (1/1) ... [2022-02-20 17:29:36,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55675ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:36, skipping insertion in model container [2022-02-20 17:29:36,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:36" (1/1) ... [2022-02-20 17:29:36,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:36,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:36,392 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_unwindbound1.c[538,551] [2022-02-20 17:29:36,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:36,409 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:36,416 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_unwindbound1.c[538,551] [2022-02-20 17:29:36,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:36,430 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:36,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:36 WrapperNode [2022-02-20 17:29:36,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:36,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:36,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:36,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:36,436 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:36" (1/1) ... [2022-02-20 17:29:36,440 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:36" (1/1) ... [2022-02-20 17:29:36,464 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:29:36,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:36,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:36,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:36,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:36,470 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:36" (1/1) ... [2022-02-20 17:29:36,470 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:36" (1/1) ... [2022-02-20 17:29:36,478 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:36" (1/1) ... [2022-02-20 17:29:36,478 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:36" (1/1) ... [2022-02-20 17:29:36,485 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:36" (1/1) ... [2022-02-20 17:29:36,491 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:36" (1/1) ... [2022-02-20 17:29:36,491 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:36" (1/1) ... [2022-02-20 17:29:36,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:36,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:36,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:36,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:36,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:36" (1/1) ... [2022-02-20 17:29:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:36,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:36,520 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:36,521 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:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:36,586 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:36,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:36,740 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:36,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:36,749 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:29:36,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:36 BoogieIcfgContainer [2022-02-20 17:29:36,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:36,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:36,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:36,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:36,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:36" (1/3) ... [2022-02-20 17:29:36,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c30128e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:36, skipping insertion in model container [2022-02-20 17:29:36,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:36" (2/3) ... [2022-02-20 17:29:36,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c30128e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:36, skipping insertion in model container [2022-02-20 17:29:36,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:36" (3/3) ... [2022-02-20 17:29:36,770 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound1.c [2022-02-20 17:29:36,773 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:36,773 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:36,818 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:36,822 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:36,822 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:36,840 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:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:29:36,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:36,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:36,843 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:29:36,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:36,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382552567] [2022-02-20 17:29:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:36,991 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:36,992 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:36,992 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:36,993 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:36,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:29:36,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:29:36,993 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:36,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:29:36,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:29:36,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:29:36,995 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:36,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:36,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382552567] [2022-02-20 17:29:36,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382552567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:36,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:36,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:37,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784027796] [2022-02-20 17:29:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:37,005 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:37,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:37,009 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:37,028 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:37,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:37,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:37,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:37,049 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:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,120 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:29:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:37,120 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:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:37,121 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:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:29:37,132 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:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:29:37,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:29:37,237 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:37,244 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:29:37,244 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:29:37,246 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:37,251 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:37,251 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:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:29:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:29:37,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:37,276 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:37,276 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:37,277 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:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,281 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:29:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:37,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:37,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:37,283 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:37,283 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:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,287 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:29:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:37,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:37,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:37,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:37,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:37,289 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:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:29:37,292 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:29:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:37,293 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:29:37,293 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:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:29:37,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:37,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:37,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:37,295 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:29:37,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:37,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96892861] [2022-02-20 17:29:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:37,365 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:37,366 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:37,367 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:37,367 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:37,368 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:37,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:29:37,372 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:37,373 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:37,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-02-20 17:29:37,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-02-20 17:29:37,374 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:37,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:37,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96892861] [2022-02-20 17:29:37,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96892861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:37,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:37,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:37,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458905848] [2022-02-20 17:29:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:37,376 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:37,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:37,378 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:37,385 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:37,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:37,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:37,388 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:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,522 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:29:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:37,523 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:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:37,523 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:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:37,527 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:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:37,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:29:37,575 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:37,577 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:29:37,578 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:29:37,584 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:37,585 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:37,586 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:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:29:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:29:37,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:37,593 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:37,593 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:37,593 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:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,597 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:29:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:29:37,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:37,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:37,601 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:37,602 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:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,605 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:29:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:29:37,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:37,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:37,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:37,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:37,608 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:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:29:37,613 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:29:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:37,614 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:29:37,614 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:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:29:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:29:37,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:37,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:37,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:29:37,616 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:29:37,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:37,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179389933] [2022-02-20 17:29:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:37,673 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:37,674 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:37,674 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:37,675 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:37,675 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:37,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {361#false} is VALID [2022-02-20 17:29:37,676 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:37,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#false} assume !(main_#t~post7#1 < 1);havoc main_#t~post7#1; {361#false} is VALID [2022-02-20 17:29:37,676 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:37,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-02-20 17:29:37,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-02-20 17:29:37,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 17:29:37,677 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:37,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:37,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179389933] [2022-02-20 17:29:37,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179389933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:37,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:37,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:37,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421723349] [2022-02-20 17:29:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:37,679 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:37,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:37,679 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:37,687 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:37,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:37,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:37,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:37,688 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:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,745 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:29:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:29:37,746 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:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:37,746 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:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:29:37,747 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:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:29:37,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:29:37,787 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:37,788 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:29:37,788 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:29:37,789 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:37,789 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:37,790 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:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:29:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:29:37,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:37,793 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:37,793 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:37,793 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:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,795 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:29:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:29:37,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:37,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:37,795 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:37,796 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:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:37,797 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:29:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:29:37,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:37,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:37,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:37,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:37,798 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:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:29:37,799 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:29:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:37,799 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:29:37,799 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:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:29:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:29:37,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:37,800 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:37,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:29:37,800 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:29:37,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:37,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431126294] [2022-02-20 17:29:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:29:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:37,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:29:37,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:29:37,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:29:37,867 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:37,867 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:37,868 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:37,868 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:37,869 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:37,869 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:37,869 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 < 1);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:37,870 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:37,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:29:37,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:29:37,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:29:37,871 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:37,871 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:37,872 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:37,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:29:37,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:29:37,873 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:37,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:37,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431126294] [2022-02-20 17:29:37,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431126294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:37,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:37,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:37,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446029526] [2022-02-20 17:29:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:37,874 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:37,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:37,874 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:37,884 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:37,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:37,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:37,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:37,885 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:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:38,026 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:29:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:38,026 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:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:38,026 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:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:38,027 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:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:29:38,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:29:38,075 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:38,076 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:29:38,076 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:29:38,076 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:38,077 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:38,077 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:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:29:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:29:38,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:38,081 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:38,081 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:38,081 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:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:38,083 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:29:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:29:38,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:38,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:38,083 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:38,083 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:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:38,085 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:29:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:29:38,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:38,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:38,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:38,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:38,085 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:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:29:38,086 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:29:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:38,086 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:29:38,087 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:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:29:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:29:38,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:38,087 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:38,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:29:38,087 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:29:38,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:38,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753170281] [2022-02-20 17:29:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:38,098 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:38,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161921230] [2022-02-20 17:29:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:38,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:38,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:38,100 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:38,100 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:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:38,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 17:29:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:38,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:38,736 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:38,737 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:38,739 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:38,740 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:38,741 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:38,741 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 < 1);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:38,741 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:38,742 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:38,742 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:38,743 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:38,744 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:38,744 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:38,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:29:38,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:29:38,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:29:38,745 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:38,745 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:38,746 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:38,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {793#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:29:38,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:29:38,746 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:38,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:47,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:29:47,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {793#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:29:47,986 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:47,986 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:47,987 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:47,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:29:47,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:29:47,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:29:47,988 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:47,988 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:47,989 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:47,989 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:47,990 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:47,990 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:47,990 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 < 1);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:47,991 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:47,991 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:47,991 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:47,992 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:47,992 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:47,992 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:47,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:47,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753170281] [2022-02-20 17:29:47,992 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:47,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161921230] [2022-02-20 17:29:47,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161921230] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:47,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:47,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-02-20 17:29:47,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675877295] [2022-02-20 17:29:47,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:47,994 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:47,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:47,995 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:48,037 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:48,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:29:48,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:29:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:29:48,038 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:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:49,152 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-02-20 17:29:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:29:49,152 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:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:49,152 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:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-02-20 17:29:49,154 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:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-02-20 17:29:49,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-02-20 17:29:49,235 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:49,237 INFO L225 Difference]: With dead ends: 75 [2022-02-20 17:29:49,237 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:29:49,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:29:49,239 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 72 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:49,239 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.4s Time] [2022-02-20 17:29:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:29:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-02-20 17:29:49,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:49,254 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:49,255 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:49,255 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:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:49,262 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-02-20 17:29:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-02-20 17:29:49,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:49,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:49,263 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:49,264 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:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:49,266 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-02-20 17:29:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-02-20 17:29:49,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:49,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:49,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:49,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:49,267 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:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-02-20 17:29:49,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 20 [2022-02-20 17:29:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:49,275 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-02-20 17:29:49,275 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:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-02-20 17:29:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:29:49,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:49,276 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:49,292 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:49,476 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:49,476 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:29:49,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:49,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28021778] [2022-02-20 17:29:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:49,492 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:49,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268819898] [2022-02-20 17:29:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:49,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:49,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:49,500 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:49,500 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:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:49,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:29:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:49,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:49,697 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; {1175#true} is VALID [2022-02-20 17:29:49,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#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; {1175#true} is VALID [2022-02-20 17:29:49,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume !(0 == assume_abort_if_not_~cond#1); {1175#true} is VALID [2022-02-20 17:29:49,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {1175#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; {1189#(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:49,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {1189#(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; {1189#(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:49,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#(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 < 1);havoc main_#t~post6#1; {1189#(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:49,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {1189#(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)); {1175#true} is VALID [2022-02-20 17:29:49,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} ~cond := #in~cond; {1175#true} is VALID [2022-02-20 17:29:49,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} assume !(0 == ~cond); {1175#true} is VALID [2022-02-20 17:29:49,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-02-20 17:29:49,701 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1175#true} {1189#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} #74#return; {1189#(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:49,701 INFO L272 TraceCheckUtils]: 11: Hoare triple {1189#(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)); {1175#true} is VALID [2022-02-20 17:29:49,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1175#true} ~cond := #in~cond; {1175#true} is VALID [2022-02-20 17:29:49,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {1175#true} assume !(0 == ~cond); {1175#true} is VALID [2022-02-20 17:29:49,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-02-20 17:29:49,704 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1175#true} {1189#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} #76#return; {1189#(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:49,704 INFO L272 TraceCheckUtils]: 16: Hoare triple {1189#(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)); {1175#true} is VALID [2022-02-20 17:29:49,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1175#true} ~cond := #in~cond; {1175#true} is VALID [2022-02-20 17:29:49,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {1175#true} assume !(0 == ~cond); {1175#true} is VALID [2022-02-20 17:29:49,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-02-20 17:29:49,706 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1175#true} {1189#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} #78#return; {1189#(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:49,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {1189#(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); {1189#(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:49,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {1189#(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; {1189#(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:49,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(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 < 1);havoc main_#t~post7#1; {1189#(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:49,710 INFO L272 TraceCheckUtils]: 24: Hoare triple {1189#(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_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:49,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:49,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1176#false} is VALID [2022-02-20 17:29:49,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-02-20 17:29:49,721 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:49,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:49,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:49,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28021778] [2022-02-20 17:29:49,722 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:49,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268819898] [2022-02-20 17:29:49,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268819898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:49,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:49,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:49,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845987797] [2022-02-20 17:29:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:49,723 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:49,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:49,723 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:49,741 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:49,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:49,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:49,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:49,742 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), 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:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:49,965 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-02-20 17:29:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:49,965 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:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:49,966 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:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:29:49,967 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:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:29:49,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:29:50,018 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:50,019 INFO L225 Difference]: With dead ends: 71 [2022-02-20 17:29:50,020 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 17:29:50,020 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:50,020 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:50,021 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:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 17:29:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-02-20 17:29:50,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:50,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:50,041 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:50,041 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:50,043 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-02-20 17:29:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2022-02-20 17:29:50,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:50,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:50,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-02-20 17:29:50,044 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-02-20 17:29:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:50,045 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-02-20 17:29:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2022-02-20 17:29:50,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:50,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:50,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:50,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:29:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2022-02-20 17:29:50,048 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 28 [2022-02-20 17:29:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:50,048 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-02-20 17:29:50,048 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:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-02-20 17:29:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:29:50,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:50,048 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:50,068 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:50,262 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:50,262 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1091220578, now seen corresponding path program 1 times [2022-02-20 17:29:50,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:50,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274799779] [2022-02-20 17:29:50,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:50,274 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:50,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775363236] [2022-02-20 17:29:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:50,276 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:50,277 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:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:50,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:50,333 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:29:50,333 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:50,334 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:50,369 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:50,547 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:50,550 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:50,552 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:50,561 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:50,562 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:50,572 INFO L158 Benchmark]: Toolchain (without parser) took 14326.60ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 68.2MB in the beginning and 77.0MB in the end (delta: -8.8MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:50,573 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:50,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.94ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 74.0MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:50,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.77ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 72.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:50,573 INFO L158 Benchmark]: Boogie Preprocessor took 27.76ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 71.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:50,573 INFO L158 Benchmark]: RCFGBuilder took 257.24ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 60.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:50,573 INFO L158 Benchmark]: TraceAbstraction took 13820.55ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 59.8MB in the beginning and 78.1MB in the end (delta: -18.3MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:50,574 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.15ms. Allocated memory is still 100.7MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.94ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 74.0MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.77ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 72.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.76ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 71.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.24ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 60.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13820.55ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 59.8MB in the beginning and 78.1MB in the end (delta: -18.3MB). Peak memory consumption was 4.1MB. 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:50,592 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_unwindbound1.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 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:52,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:52,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:52,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:52,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:52,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:52,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:52,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:52,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:52,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:52,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:52,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:52,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:52,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:52,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:52,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:52,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:52,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:52,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:52,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:52,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:52,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:52,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:52,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:52,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:52,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:52,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:52,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:52,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:52,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:52,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:52,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:52,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:52,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:52,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:52,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:52,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:52,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:52,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:52,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:52,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:52,322 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:52,349 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:52,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:52,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:52,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:52,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:52,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:52,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:52,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:52,352 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:52,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:52,353 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:29:52,354 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:29:52,354 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:29:52,354 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:52,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:52,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:52,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:52,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:52,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:52,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:52,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:52,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:52,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:52,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:52,355 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:29:52,356 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:29:52,356 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:52,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:52,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:52,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:29:52,356 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 -> 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 [2022-02-20 17:29:52,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:52,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:52,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:52,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:52,633 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:52,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2022-02-20 17:29:52,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439beebbc/10ae10a122f741fc86c06d8711c5bf7c/FLAG5b7cc5d2f [2022-02-20 17:29:52,985 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:52,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2022-02-20 17:29:52,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439beebbc/10ae10a122f741fc86c06d8711c5bf7c/FLAG5b7cc5d2f [2022-02-20 17:29:53,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439beebbc/10ae10a122f741fc86c06d8711c5bf7c [2022-02-20 17:29:53,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:53,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:53,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:53,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:53,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:53,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:53" (1/1) ... [2022-02-20 17:29:53,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2958227c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:53, skipping insertion in model container [2022-02-20 17:29:53,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:53" (1/1) ... [2022-02-20 17:29:53,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:53,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:53,568 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_unwindbound1.c[538,551] [2022-02-20 17:29:53,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:53,591 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:53,639 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_unwindbound1.c[538,551] [2022-02-20 17:29:53,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:53,653 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:53,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:53 WrapperNode [2022-02-20 17:29:53,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:53,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:53,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:53,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:53,659 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:53" (1/1) ... [2022-02-20 17:29:53,663 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:53" (1/1) ... [2022-02-20 17:29:53,677 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:29:53,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:53,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:53,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:53,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:53,682 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:53" (1/1) ... [2022-02-20 17:29:53,683 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:53" (1/1) ... [2022-02-20 17:29:53,684 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:53" (1/1) ... [2022-02-20 17:29:53,684 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:53" (1/1) ... [2022-02-20 17:29:53,688 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:53" (1/1) ... [2022-02-20 17:29:53,692 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:53" (1/1) ... [2022-02-20 17:29:53,692 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:53" (1/1) ... [2022-02-20 17:29:53,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:53,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:53,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:53,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:53,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:53" (1/1) ... [2022-02-20 17:29:53,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:53,740 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:53,747 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:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:29:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:53,816 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:53,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:54,196 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:54,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:54,201 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:29:54,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:54 BoogieIcfgContainer [2022-02-20 17:29:54,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:54,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:54,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:54,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:54,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:53" (1/3) ... [2022-02-20 17:29:54,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0fdbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:54, skipping insertion in model container [2022-02-20 17:29:54,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:53" (2/3) ... [2022-02-20 17:29:54,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0fdbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:54, skipping insertion in model container [2022-02-20 17:29:54,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:54" (3/3) ... [2022-02-20 17:29:54,208 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound1.c [2022-02-20 17:29:54,211 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:54,211 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:54,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:54,251 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:54,252 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:54,266 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:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:29:54,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:54,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:54,271 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:29:54,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:54,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156386650] [2022-02-20 17:29:54,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:54,284 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:29:54,285 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:29:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:54,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:29:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:54,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:54,403 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:29:54,403 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:29:54,404 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:29:54,404 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:29:54,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:29:54,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:29:54,405 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:29:54,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:29:54,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0bv32 == ~cond; {32#false} is VALID [2022-02-20 17:29:54,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:29:54,406 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:54,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:54,406 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:54,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156386650] [2022-02-20 17:29:54,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156386650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:54,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:54,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:54,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427703114] [2022-02-20 17:29:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:54,411 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:54,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:54,414 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:54,445 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:54,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:54,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:54,473 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:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:55,112 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:29:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:55,113 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:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:55,113 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:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:29:55,119 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:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:29:55,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:29:55,852 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:55,857 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:29:55,858 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:29:55,859 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:29:55,861 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:55,862 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:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:29:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:29:55,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:55,880 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:55,881 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:55,881 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:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:55,884 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:29:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:55,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:55,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:55,885 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:55,885 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:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:55,887 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:29:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:55,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:55,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:55,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:55,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:55,888 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:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:29:55,891 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:29:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:55,891 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:29:55,891 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:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:29:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:29:55,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:55,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:55,910 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:29:56,100 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:29:56,101 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:29:56,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:56,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236256277] [2022-02-20 17:29:56,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:56,104 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:29:56,106 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:29:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:56,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:29:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:56,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:56,216 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:29:56,216 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:29:56,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {216#true} is VALID [2022-02-20 17:29:56,217 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:29:56,218 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:29:56,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {230#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 64))} is VALID [2022-02-20 17:29:56,220 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:29:56,220 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:29:56,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {217#false} is VALID [2022-02-20 17:29:56,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#false} assume !false; {217#false} is VALID [2022-02-20 17:29:56,222 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:56,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:56,222 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:56,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236256277] [2022-02-20 17:29:56,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236256277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:56,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:56,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:56,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076430] [2022-02-20 17:29:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:56,228 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:56,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:56,229 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:56,238 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:56,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:56,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:56,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:56,239 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:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:58,595 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:29:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:58,595 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:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:58,596 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:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:29:58,598 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:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:29:58,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:29:59,162 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:59,163 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:29:59,163 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:29:59,164 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:29:59,164 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:29:59,165 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:29:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:29:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:29:59,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:59,169 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:59,169 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:59,169 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:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:59,177 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:29:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:29:59,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:59,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:59,178 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:59,179 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:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:59,181 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:29:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:29:59,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:59,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:59,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:59,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:59,182 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:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:29:59,184 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:29:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:59,184 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:29:59,184 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:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:29:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:29:59,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:59,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:59,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:29:59,390 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:29:59,391 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:29:59,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:59,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156975668] [2022-02-20 17:29:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:59,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:59,394 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:29:59,395 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:29:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:59,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:29:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:59,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:59,499 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:29:59,500 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:29:59,500 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:29:59,501 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:29:59,501 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:29:59,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {415#false} is VALID [2022-02-20 17:29:59,502 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:29:59,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#false} assume !~bvslt32(main_#t~post7#1, 1bv32);havoc main_#t~post7#1; {415#false} is VALID [2022-02-20 17:29:59,502 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:29:59,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-02-20 17:29:59,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} assume 0bv32 == ~cond; {415#false} is VALID [2022-02-20 17:29:59,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-02-20 17:29:59,503 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:59,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:59,503 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:59,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156975668] [2022-02-20 17:29:59,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156975668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:59,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:59,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:59,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897460111] [2022-02-20 17:29:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:59,504 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:59,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:59,505 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:59,545 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:59,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:59,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:59,547 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:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:01,458 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:30:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:30:01,459 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:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:01,459 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:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:30:01,465 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:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:30:01,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:30:02,070 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:02,071 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:30:02,071 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:30:02,071 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:02,072 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:02,072 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:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:30:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:30:02,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:02,075 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:02,076 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:02,076 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:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:02,077 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:30:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:02,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:02,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:02,078 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:02,078 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:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:02,080 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:30:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:02,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:02,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:02,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:02,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:02,081 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:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:30:02,082 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:30:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:02,083 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:30:02,083 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:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:30:02,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:02,083 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:02,091 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:02,291 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:02,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:30:02,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:02,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521649293] [2022-02-20 17:30:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:02,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:02,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:02,294 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:02,295 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:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:02,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:30:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:02,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:02,405 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:02,406 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:02,406 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:02,406 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:02,407 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:02,407 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, 1bv32);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:02,407 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:02,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-02-20 17:30:02,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0bv32 == ~cond); {614#true} is VALID [2022-02-20 17:30:02,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-02-20 17:30:02,408 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:02,409 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:02,409 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:02,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {615#false} is VALID [2022-02-20 17:30:02,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-02-20 17:30:02,410 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:02,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:02,410 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:02,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521649293] [2022-02-20 17:30:02,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521649293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:02,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:02,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:02,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993887948] [2022-02-20 17:30:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:02,411 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:02,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:02,411 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:02,423 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:02,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:02,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:02,424 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:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:05,675 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:30:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:05,675 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:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:05,676 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:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:05,678 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:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:05,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:30:06,276 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:06,277 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:30:06,277 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:30:06,278 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:06,278 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:06,279 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.3s Time] [2022-02-20 17:30:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:30:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:30:06,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:06,283 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:06,283 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:06,284 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:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:06,286 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:30:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:30:06,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:06,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:06,287 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:06,287 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:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:06,289 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:30:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:30:06,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:06,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:06,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:06,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:06,290 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:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:30:06,291 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:30:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:06,291 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:30:06,292 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:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:30:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:30:06,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:06,292 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:06,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:06,498 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:06,498 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:30:06,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:06,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998385767] [2022-02-20 17:30:06,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:06,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:06,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:06,500 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:06,501 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:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:06,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:06,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:06,698 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:06,698 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:06,698 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:06,699 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:06,700 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:06,700 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, 1bv32);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:06,700 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:06,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#true} ~cond := #in~cond; {855#true} is VALID [2022-02-20 17:30:06,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {855#true} assume !(0bv32 == ~cond); {855#true} is VALID [2022-02-20 17:30:06,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#true} assume true; {855#true} is VALID [2022-02-20 17:30:06,701 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:06,701 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:06,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#true} ~cond := #in~cond; {855#true} is VALID [2022-02-20 17:30:06,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {855#true} assume !(0bv32 == ~cond); {855#true} is VALID [2022-02-20 17:30:06,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#true} assume true; {855#true} is VALID [2022-02-20 17:30:06,702 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:06,703 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:06,703 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:06,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {856#false} is VALID [2022-02-20 17:30:06,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-02-20 17:30:06,704 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:06,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:06,704 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:06,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998385767] [2022-02-20 17:30:06,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998385767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:06,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:06,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:06,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424909210] [2022-02-20 17:30:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:06,705 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:06,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:06,706 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:06,745 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:06,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:06,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:06,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:06,746 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:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:10,090 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-02-20 17:30:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:10,090 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:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:10,091 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:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-02-20 17:30:10,093 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:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-02-20 17:30:10,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-02-20 17:30:10,941 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:10,942 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:30:10,942 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:30:10,942 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:10,943 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:10,943 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.6s Time] [2022-02-20 17:30:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:30:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:30:10,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:10,948 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:10,948 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:10,949 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:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:10,951 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:30:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:30:10,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:10,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:10,952 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:10,952 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:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:10,954 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:30:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:30:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:10,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:10,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:10,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:10,955 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:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-02-20 17:30:10,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2022-02-20 17:30:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:10,964 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-02-20 17:30:10,964 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:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:30:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:30:10,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:10,965 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:10,973 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:11,165 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:11,166 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:30:11,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:11,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470522236] [2022-02-20 17:30:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:11,168 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:11,169 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:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:11,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:30:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:11,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:11,530 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; {1172#true} is VALID [2022-02-20 17:30:11,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {1172#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; {1172#true} is VALID [2022-02-20 17:30:11,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {1172#true} is VALID [2022-02-20 17:30:11,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {1172#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; {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {1172#true} is VALID [2022-02-20 17:30:11,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-02-20 17:30:11,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#true} assume !(0bv32 == ~cond); {1172#true} is VALID [2022-02-20 17:30:11,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-02-20 17:30:11,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1172#true} {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #74#return; {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,535 INFO L272 TraceCheckUtils]: 11: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~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)); {1172#true} is VALID [2022-02-20 17:30:11,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-02-20 17:30:11,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {1172#true} assume !(0bv32 == ~cond); {1172#true} is VALID [2022-02-20 17:30:11,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-02-20 17:30:11,535 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1172#true} {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #76#return; {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,536 INFO L272 TraceCheckUtils]: 16: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~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)); {1172#true} is VALID [2022-02-20 17:30:11,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {1172#true} ~cond := #in~cond; {1172#true} is VALID [2022-02-20 17:30:11,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#true} assume !(0bv32 == ~cond); {1172#true} is VALID [2022-02-20 17:30:11,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#true} assume true; {1172#true} is VALID [2022-02-20 17:30:11,536 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1172#true} {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #78#return; {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !~bvsge64(main_~r~0#1, main_~d~0#1); {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !~bvslt32(main_#t~post7#1, 1bv32);havoc main_#t~post7#1; {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:30:11,540 INFO L272 TraceCheckUtils]: 24: Hoare triple {1186#(and (= |ULTIMATE.start_main_~r~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~A~0#1|)) (exists ((|ULTIMATE.start_main_~B~0#1| (_ BitVec 32))) (= |ULTIMATE.start_main_~d~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~B~0#1|))) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} 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)); {1250#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:11,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {1250#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:11,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {1254#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {1173#false} is VALID [2022-02-20 17:30:11,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {1173#false} assume !false; {1173#false} is VALID [2022-02-20 17:30:11,541 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:11,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:11,541 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:11,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470522236] [2022-02-20 17:30:11,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470522236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:11,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:11,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:11,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137415934] [2022-02-20 17:30:11,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:11,542 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:11,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:11,542 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:11,623 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:11,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:11,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:11,624 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), 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:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:14,059 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-02-20 17:30:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:14,060 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:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:14,060 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:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 17:30:14,062 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:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 17:30:14,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-02-20 17:30:14,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:14,521 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:30:14,521 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:30:14,521 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:14,522 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:14,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 129 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-02-20 17:30:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:30:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:30:14,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:14,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:14,533 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:14,534 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:14,537 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-02-20 17:30:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-02-20 17:30:14,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:14,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:14,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-02-20 17:30:14,539 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-02-20 17:30:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:14,542 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-02-20 17:30:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-02-20 17:30:14,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:14,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:14,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:14,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-02-20 17:30:14,545 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-02-20 17:30:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:14,547 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-02-20 17:30:14,547 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:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-02-20 17:30:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:30:14,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:14,548 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:14,570 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:14,755 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:14,756 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-02-20 17:30:14,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:14,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482201942] [2022-02-20 17:30:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:14,758 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:14,761 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:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:14,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:14,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:14,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {1488#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; {1493#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:14,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#(= ~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; {1493#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:14,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {1493#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:14,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {1493#(= ~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; {1493#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:30:14,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {1493#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if 0bv64 == main_~q~0#1 then 1bv32 else 0bv32)); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume true; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1506#(= ~counter~0 (_ bv1 32))} {1506#(= ~counter~0 (_ bv1 32))} #74#return; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,932 INFO L272 TraceCheckUtils]: 11: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} call __VERIFIER_assert((if main_~r~0#1 == ~zero_extendFrom32To64(main_~A~0#1) then 1bv32 else 0bv32)); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume true; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,933 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1506#(= ~counter~0 (_ bv1 32))} {1506#(= ~counter~0 (_ bv1 32))} #76#return; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,933 INFO L272 TraceCheckUtils]: 16: Hoare triple {1506#(= ~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)); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} ~cond := #in~cond; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume !(0bv32 == ~cond); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume true; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,935 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1506#(= ~counter~0 (_ bv1 32))} {1506#(= ~counter~0 (_ bv1 32))} #78#return; {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} assume !~bvsge64(main_~r~0#1, main_~d~0#1); {1506#(= ~counter~0 (_ bv1 32))} is VALID [2022-02-20 17:30:14,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {1506#(= ~counter~0 (_ bv1 32))} main_#t~post7#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post7#1); {1561#(= |ULTIMATE.start_main_#t~post7#1| (_ bv1 32))} is VALID [2022-02-20 17:30:14,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {1561#(= |ULTIMATE.start_main_#t~post7#1| (_ bv1 32))} assume !!~bvslt32(main_#t~post7#1, 1bv32);havoc main_#t~post7#1; {1489#false} is VALID [2022-02-20 17:30:14,936 INFO L272 TraceCheckUtils]: 24: Hoare triple {1489#false} 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)); {1489#false} is VALID [2022-02-20 17:30:14,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#false} ~cond := #in~cond; {1489#false} is VALID [2022-02-20 17:30:14,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {1489#false} assume 0bv32 == ~cond; {1489#false} is VALID [2022-02-20 17:30:14,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2022-02-20 17:30:14,937 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:14,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:14,937 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:14,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482201942] [2022-02-20 17:30:14,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482201942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:14,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:14,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:30:14,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712299137] [2022-02-20 17:30:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:14,938 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:14,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:14,938 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:15,000 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:15,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:15,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:15,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:15,001 INFO L87 Difference]: Start difference. First operand 45 states and 56 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:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:17,315 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-02-20 17:30:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:17,315 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:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:17,316 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:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:30:17,317 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:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:30:17,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-02-20 17:30:17,683 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:17,684 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:30:17,684 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:30:17,684 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:17,685 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:17,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:30:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:30:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-02-20 17:30:17,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:17,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:17,689 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:17,689 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:17,690 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-20 17:30:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-20 17:30:17,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:17,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:17,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-02-20 17:30:17,691 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-02-20 17:30:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:17,692 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-02-20 17:30:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-20 17:30:17,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:17,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:17,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:17,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:30:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-02-20 17:30:17,694 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 28 [2022-02-20 17:30:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:17,694 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-02-20 17:30:17,694 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:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-02-20 17:30:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:30:17,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:17,695 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:17,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:17,902 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:17,902 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1040101153, now seen corresponding path program 1 times [2022-02-20 17:30:17,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:17,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575043726] [2022-02-20 17:30:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:17,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:17,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:17,904 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:17,904 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:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:17,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:17,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:18,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#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; {1827#true} is VALID [2022-02-20 17:30:18,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#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; {1827#true} is VALID [2022-02-20 17:30:18,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {1827#true} is VALID [2022-02-20 17:30:18,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {1827#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; {1841#(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:18,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {1841#(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); {1841#(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:18,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(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, 1bv32);havoc main_#t~post6#1; {1841#(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:18,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {1841#(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)); {1827#true} is VALID [2022-02-20 17:30:18,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-02-20 17:30:18,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {1827#true} assume !(0bv32 == ~cond); {1827#true} is VALID [2022-02-20 17:30:18,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-02-20 17:30:18,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1827#true} {1841#(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; {1841#(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:18,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {1841#(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)); {1827#true} is VALID [2022-02-20 17:30:18,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-02-20 17:30:18,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#true} assume !(0bv32 == ~cond); {1827#true} is VALID [2022-02-20 17:30:18,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-02-20 17:30:18,202 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1827#true} {1841#(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; {1841#(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:18,202 INFO L272 TraceCheckUtils]: 16: Hoare triple {1841#(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)); {1827#true} is VALID [2022-02-20 17:30:18,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-02-20 17:30:18,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#true} assume !(0bv32 == ~cond); {1827#true} is VALID [2022-02-20 17:30:18,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-02-20 17:30:18,203 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1827#true} {1841#(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; {1841#(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:18,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {1841#(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);main_~d~0#1 := ~bvmul64(2bv64, main_~d~0#1);main_~p~0#1 := ~bvmul64(2bv64, main_~p~0#1); {1841#(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:18,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {1841#(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); {1841#(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:18,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {1841#(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, 1bv32);havoc main_#t~post6#1; {1841#(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:18,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#(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); {1841#(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:18,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {1841#(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, 1bv32);havoc main_#t~post7#1; {1841#(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:18,206 INFO L272 TraceCheckUtils]: 26: Hoare triple {1841#(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_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1911#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:18,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {1911#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1915#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:30:18,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {1915#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {1828#false} is VALID [2022-02-20 17:30:18,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-02-20 17:30:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:30:18,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:18,207 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:30:18,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575043726] [2022-02-20 17:30:18,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575043726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:18,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:18,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:18,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398013565] [2022-02-20 17:30:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:18,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 30 [2022-02-20 17:30:18,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:18,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:18,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:18,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:18,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:30:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:18,283 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:21,492 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-02-20 17:30:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:21,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 30 [2022-02-20 17:30:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 17:30:21,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 17:30:22,083 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:22,084 INFO L225 Difference]: With dead ends: 64 [2022-02-20 17:30:22,084 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 17:30:22,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:22,085 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 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:22,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 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:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 17:30:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-02-20 17:30:22,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:22,091 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:22,091 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:22,091 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:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:22,094 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 17:30:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-02-20 17:30:22,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:22,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:22,095 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:22,095 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:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:22,097 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 17:30:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-02-20 17:30:22,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:22,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:22,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:22,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:22,098 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:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2022-02-20 17:30:22,099 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 30 [2022-02-20 17:30:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:22,099 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2022-02-20 17:30:22,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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,100 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-02-20 17:30:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:30:22,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:22,100 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:22,112 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:22,310 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:22,310 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1091220578, now seen corresponding path program 1 times [2022-02-20 17:30:22,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:30:22,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886129614] [2022-02-20 17:30:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:30:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:30:22,315 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:22,316 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:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:30:22,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:30:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:30:22,460 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:30:22,460 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:30:22,461 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:30:22,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 17:30:22,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:30:22,665 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:22,667 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:30:22,680 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0bv64 == ~q~0 then 1bv32 else 0bv32)); [2022-02-20 17:30:22,680 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:30:22,682 INFO L158 Benchmark]: Toolchain (without parser) took 29240.71ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 32.0MB in the beginning and 46.1MB in the end (delta: -14.1MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2022-02-20 17:30:22,682 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 36.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:30:22,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.47ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 31.8MB in the beginning and 54.1MB in the end (delta: -22.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 17:30:22,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.80ms. Allocated memory is still 71.3MB. Free memory was 54.0MB in the beginning and 52.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:30:22,683 INFO L158 Benchmark]: Boogie Preprocessor took 16.30ms. Allocated memory is still 71.3MB. Free memory was 52.4MB in the beginning and 50.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:30:22,683 INFO L158 Benchmark]: RCFGBuilder took 508.34ms. Allocated memory is still 71.3MB. Free memory was 50.9MB in the beginning and 40.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:30:22,683 INFO L158 Benchmark]: TraceAbstraction took 28477.40ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 46.1MB in the end (delta: -5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:30:22,684 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.14ms. Allocated memory is still 54.5MB. Free memory is still 36.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.47ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 31.8MB in the beginning and 54.1MB in the end (delta: -22.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.80ms. Allocated memory is still 71.3MB. Free memory was 54.0MB in the beginning and 52.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.30ms. Allocated memory is still 71.3MB. Free memory was 52.4MB in the beginning and 50.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.34ms. Allocated memory is still 71.3MB. Free memory was 50.9MB in the beginning and 40.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28477.40ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 46.1MB in the end (delta: -5.8MB). There was no memory consumed. 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:30:22,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator