./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.i --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/divbin_unwindbound50.i -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 462bdab67ac93ddd789186f30bfdfc189629d2959c27ec219da5960b800d2042 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:19:25,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:19:25,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:19:25,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:19:25,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:19:25,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:19:25,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:19:25,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:19:25,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:19:25,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:19:25,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:19:25,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:19:25,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:19:25,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:19:25,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:19:25,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:19:25,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:19:25,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:19:25,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:19:25,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:19:25,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:19:25,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:19:25,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:19:25,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:19:25,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:19:25,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:19:25,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:19:25,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:19:25,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:19:25,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:19:25,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:19:25,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:19:25,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:19:25,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:19:25,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:19:25,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:19:25,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:19:25,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:19:25,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:19:25,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:19:25,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:19:25,150 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:19:25,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:19:25,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:19:25,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:19:25,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:19:25,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:19:25,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:19:25,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:19:25,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:19:25,194 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:19:25,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:19:25,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:19:25,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:19:25,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:19:25,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:19:25,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:19:25,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:19:25,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:19:25,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:19:25,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:19:25,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:19:25,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:19:25,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:19:25,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:19:25,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:19:25,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:19:25,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:19:25,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:19:25,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:19:25,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:19:25,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:19:25,200 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:19:25,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:19:25,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:19:25,200 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 -> 462bdab67ac93ddd789186f30bfdfc189629d2959c27ec219da5960b800d2042 [2022-02-20 17:19:25,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:19:25,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:19:25,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:19:25,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:19:25,471 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:19:25,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.i [2022-02-20 17:19:25,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2b5b448/5de3ad3318c649f890c791d1a05019ff/FLAG931abbdb1 [2022-02-20 17:19:25,978 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:19:25,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.i [2022-02-20 17:19:25,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2b5b448/5de3ad3318c649f890c791d1a05019ff/FLAG931abbdb1 [2022-02-20 17:19:26,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2b5b448/5de3ad3318c649f890c791d1a05019ff [2022-02-20 17:19:26,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:19:26,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:19:26,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:19:26,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:19:26,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:19:26,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462894e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26, skipping insertion in model container [2022-02-20 17:19:26,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:19:26,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:19:26,677 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/divbin_unwindbound50.i[950,963] [2022-02-20 17:19:26,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:19:26,702 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:19:26,713 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/divbin_unwindbound50.i[950,963] [2022-02-20 17:19:26,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:19:26,731 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:19:26,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26 WrapperNode [2022-02-20 17:19:26,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:19:26,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:19:26,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:19:26,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:19:26,739 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:19:26" (1/1) ... [2022-02-20 17:19:26,744 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:19:26" (1/1) ... [2022-02-20 17:19:26,760 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-02-20 17:19:26,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:19:26,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:19:26,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:19:26,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:19:26,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:19:26,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:19:26,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:19:26,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:19:26,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (1/1) ... [2022-02-20 17:19:26,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:19:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:26,817 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:19:26,818 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:19:26,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:19:26,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:19:26,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:19:26,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:19:26,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:19:26,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:19:26,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:19:26,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:19:26,889 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:19:26,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:19:27,051 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:19:27,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:19:27,057 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:19:27,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:19:27 BoogieIcfgContainer [2022-02-20 17:19:27,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:19:27,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:19:27,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:19:27,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:19:27,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:19:26" (1/3) ... [2022-02-20 17:19:27,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c431658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:19:27, skipping insertion in model container [2022-02-20 17:19:27,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:26" (2/3) ... [2022-02-20 17:19:27,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c431658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:19:27, skipping insertion in model container [2022-02-20 17:19:27,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:19:27" (3/3) ... [2022-02-20 17:19:27,069 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound50.i [2022-02-20 17:19:27,074 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:19:27,074 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:19:27,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:19:27,154 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:19:27,158 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:19:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:19:27,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:27,188 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:27,189 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1267887399, now seen corresponding path program 1 times [2022-02-20 17:19:27,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:27,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027095857] [2022-02-20 17:19:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:19:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:27,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:19:27,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:19:27,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:19:27,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #73#return; {32#false} is VALID [2022-02-20 17:19:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:19:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:27,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:19:27,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:19:27,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:19:27,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {32#false} #75#return; {32#false} is VALID [2022-02-20 17:19:27,379 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(9, 2);~counter~0 := 0; {31#true} is VALID [2022-02-20 17:19:27,379 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~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {31#true} is VALID [2022-02-20 17:19:27,380 INFO L272 TraceCheckUtils]: 2: Hoare triple {31#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {31#true} is VALID [2022-02-20 17:19:27,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:19:27,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:19:27,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:19:27,381 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#false} {31#true} #73#return; {32#false} is VALID [2022-02-20 17:19:27,382 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {31#true} is VALID [2022-02-20 17:19:27,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:19:27,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:19:27,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:19:27,383 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {32#false} {32#false} #75#return; {32#false} is VALID [2022-02-20 17:19:27,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {32#false} is VALID [2022-02-20 17:19:27,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:19:27,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:19:27,385 INFO L272 TraceCheckUtils]: 15: Hoare triple {32#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-02-20 17:19:27,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:19:27,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:19:27,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:19:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:27,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:27,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027095857] [2022-02-20 17:19:27,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027095857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:19:27,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:19:27,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:19:27,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796965907] [2022-02-20 17:19:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:19:27,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:27,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:19:27,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:27,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:19:27,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:27,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:19:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:19:27,446 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:19:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:27,523 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-02-20 17:19:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:19:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:19:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:19:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 17:19:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:19:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 17:19:27,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 17:19:27,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:27,677 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:19:27,678 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:19:27,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:19:27,684 INFO L933 BasicCegarLoop]: 34 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, 34 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:19:27,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:19:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:19:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:19:27,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:27,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:27,713 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:27,713 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:27,719 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-02-20 17:19:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 17:19:27,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:27,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:27,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:19:27,721 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:19:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:27,724 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-02-20 17:19:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 17:19:27,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:27,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:27,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:27,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-02-20 17:19:27,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-02-20 17:19:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:27,730 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-02-20 17:19:27,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:19:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 17:19:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:19:27,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:27,731 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:27,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:19:27,732 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1485611193, now seen corresponding path program 1 times [2022-02-20 17:19:27,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:27,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440169051] [2022-02-20 17:19:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:27,754 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:27,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373194309] [2022-02-20 17:19:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:27,759 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:19:27,760 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:19:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:27,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:19:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:27,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:28,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#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(9, 2);~counter~0 := 0; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,015 INFO L272 TraceCheckUtils]: 2: Hoare triple {195#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#(<= ~counter~0 0)} ~cond := #in~cond; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {195#(<= ~counter~0 0)} assume !(0 == ~cond); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#(<= ~counter~0 0)} assume true; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,017 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {195#(<= ~counter~0 0)} {195#(<= ~counter~0 0)} #73#return; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,018 INFO L272 TraceCheckUtils]: 7: Hoare triple {195#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(<= ~counter~0 0)} ~cond := #in~cond; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(<= ~counter~0 0)} assume !(0 == ~cond); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#(<= ~counter~0 0)} assume true; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,021 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {195#(<= ~counter~0 0)} {195#(<= ~counter~0 0)} #75#return; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#(<= ~counter~0 0)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:28,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#(<= ~counter~0 0)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {235#(<= |ULTIMATE.start_main_#t~post3#1| 0)} is VALID [2022-02-20 17:19:28,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= |ULTIMATE.start_main_#t~post3#1| 0)} assume !(main_#t~post3#1 < 50);havoc main_#t~post3#1; {191#false} is VALID [2022-02-20 17:19:28,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {191#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {191#false} is VALID [2022-02-20 17:19:28,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {191#false} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {191#false} is VALID [2022-02-20 17:19:28,024 INFO L272 TraceCheckUtils]: 17: Hoare triple {191#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {191#false} is VALID [2022-02-20 17:19:28,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-02-20 17:19:28,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-02-20 17:19:28,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 17:19:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:28,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:19:28,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:28,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440169051] [2022-02-20 17:19:28,027 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:28,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373194309] [2022-02-20 17:19:28,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373194309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:19:28,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:19:28,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:19:28,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896535410] [2022-02-20 17:19:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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 21 [2022-02-20 17:19:28,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:28,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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:19:28,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:28,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:19:28,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:19:28,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:19:28,059 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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:19:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:28,147 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 17:19:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:19:28,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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 21 [2022-02-20 17:19:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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:19:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 17:19:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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:19:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 17:19:28,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 17:19:28,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:28,196 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:19:28,197 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:19:28,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:19:28,198 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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:19:28,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:19:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:19:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:19:28,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:28,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:28,206 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:28,207 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:28,209 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 17:19:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:19:28,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:28,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:28,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 17:19:28,211 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 17:19:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:28,213 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 17:19:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:19:28,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:28,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:28,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:28,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:19:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 17:19:28,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 21 [2022-02-20 17:19:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:28,217 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 17:19:28,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 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:19:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:19:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:19:28,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:28,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:28,239 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:19:28,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:28,428 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1580975129, now seen corresponding path program 1 times [2022-02-20 17:19:28,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:28,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242101708] [2022-02-20 17:19:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:28,447 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:28,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066304855] [2022-02-20 17:19:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:28,449 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:19:28,451 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:19:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:28,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:19:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:28,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:30,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#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(9, 2);~counter~0 := 0; {391#true} is VALID [2022-02-20 17:19:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {391#true} is VALID [2022-02-20 17:19:30,150 INFO L272 TraceCheckUtils]: 2: Hoare triple {391#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {391#true} is VALID [2022-02-20 17:19:30,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#true} ~cond := #in~cond; {405#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:19:30,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {409#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:30,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {409#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:30,152 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {409#(not (= |assume_abort_if_not_#in~cond| 0))} {391#true} #73#return; {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} is VALID [2022-02-20 17:19:30,152 INFO L272 TraceCheckUtils]: 7: Hoare triple {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {391#true} is VALID [2022-02-20 17:19:30,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#true} ~cond := #in~cond; {391#true} is VALID [2022-02-20 17:19:30,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#true} assume !(0 == ~cond); {391#true} is VALID [2022-02-20 17:19:30,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#true} assume true; {391#true} is VALID [2022-02-20 17:19:30,154 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {391#true} {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} #75#return; {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} is VALID [2022-02-20 17:19:30,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:30,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:30,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:30,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:30,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:30,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:30,158 INFO L272 TraceCheckUtils]: 18: Hoare triple {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:30,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:30,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {392#false} is VALID [2022-02-20 17:19:30,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {392#false} assume !false; {392#false} is VALID [2022-02-20 17:19:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:19:30,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:30,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {392#false} assume !false; {392#false} is VALID [2022-02-20 17:19:30,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {392#false} is VALID [2022-02-20 17:19:30,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:30,609 INFO L272 TraceCheckUtils]: 18: Hoare triple {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:30,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:30,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:30,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:30,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:30,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:30,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:30,623 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {391#true} {391#true} #75#return; {391#true} is VALID [2022-02-20 17:19:30,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#true} assume true; {391#true} is VALID [2022-02-20 17:19:30,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#true} assume !(0 == ~cond); {391#true} is VALID [2022-02-20 17:19:30,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#true} ~cond := #in~cond; {391#true} is VALID [2022-02-20 17:19:30,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {391#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {391#true} is VALID [2022-02-20 17:19:30,624 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {391#true} {391#true} #73#return; {391#true} is VALID [2022-02-20 17:19:30,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {391#true} assume true; {391#true} is VALID [2022-02-20 17:19:30,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {391#true} assume !(0 == ~cond); {391#true} is VALID [2022-02-20 17:19:30,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#true} ~cond := #in~cond; {391#true} is VALID [2022-02-20 17:19:30,624 INFO L272 TraceCheckUtils]: 2: Hoare triple {391#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {391#true} is VALID [2022-02-20 17:19:30,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {391#true} is VALID [2022-02-20 17:19:30,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#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(9, 2);~counter~0 := 0; {391#true} is VALID [2022-02-20 17:19:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:30,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:30,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242101708] [2022-02-20 17:19:30,626 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:30,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066304855] [2022-02-20 17:19:30,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066304855] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:19:30,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:19:30,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-20 17:19:30,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902918875] [2022-02-20 17:19:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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 22 [2022-02-20 17:19:30,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:30,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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:19:30,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:30,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:19:30,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:19:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:30,644 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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:19:33,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:19:35,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:19:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:37,361 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-02-20 17:19:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:19:37,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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 22 [2022-02-20 17:19:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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:19:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:19:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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:19:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:19:37,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 17:19:37,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:37,424 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:19:37,424 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:19:37,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:19:37,425 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:37,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 91 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-02-20 17:19:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:19:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:19:37,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:37,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:37,434 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:37,434 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:37,437 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-20 17:19:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-20 17:19:37,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:37,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:37,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-02-20 17:19:37,438 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-02-20 17:19:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:37,441 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-20 17:19:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-20 17:19:37,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:37,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:37,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:37,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-02-20 17:19:37,444 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 22 [2022-02-20 17:19:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:37,445 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-02-20 17:19:37,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 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:19:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-20 17:19:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:19:37,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:37,446 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:37,474 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:19:37,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:19:37,647 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1106421036, now seen corresponding path program 1 times [2022-02-20 17:19:37,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:37,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155266641] [2022-02-20 17:19:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:37,666 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:37,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731491615] [2022-02-20 17:19:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:37,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:37,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:37,682 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:19:37,684 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:19:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:37,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:19:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:37,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:37,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {696#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(9, 2);~counter~0 := 0; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,872 INFO L272 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {701#(<= ~counter~0 0)} ~cond := #in~cond; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} assume !(0 == ~cond); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,874 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {701#(<= ~counter~0 0)} {701#(<= ~counter~0 0)} #73#return; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,874 INFO L272 TraceCheckUtils]: 7: Hoare triple {701#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#(<= ~counter~0 0)} ~cond := #in~cond; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#(<= ~counter~0 0)} assume !(0 == ~cond); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,879 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {701#(<= ~counter~0 0)} {701#(<= ~counter~0 0)} #75#return; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {701#(<= ~counter~0 0)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:37,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {701#(<= ~counter~0 0)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {741#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:37,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#(<= ~counter~0 1)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {741#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:37,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {741#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:37,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#(<= ~counter~0 1)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {751#(<= |ULTIMATE.start_main_#t~post3#1| 1)} is VALID [2022-02-20 17:19:37,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#(<= |ULTIMATE.start_main_#t~post3#1| 1)} assume !(main_#t~post3#1 < 50);havoc main_#t~post3#1; {697#false} is VALID [2022-02-20 17:19:37,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:37,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {697#false} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:37,883 INFO L272 TraceCheckUtils]: 20: Hoare triple {697#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {697#false} is VALID [2022-02-20 17:19:37,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {697#false} ~cond := #in~cond; {697#false} is VALID [2022-02-20 17:19:37,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#false} assume 0 == ~cond; {697#false} is VALID [2022-02-20 17:19:37,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2022-02-20 17:19:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:37,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:38,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2022-02-20 17:19:38,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#false} assume 0 == ~cond; {697#false} is VALID [2022-02-20 17:19:38,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {697#false} ~cond := #in~cond; {697#false} is VALID [2022-02-20 17:19:38,021 INFO L272 TraceCheckUtils]: 20: Hoare triple {697#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {697#false} is VALID [2022-02-20 17:19:38,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {697#false} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:38,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:38,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {791#(< |ULTIMATE.start_main_#t~post3#1| 50)} assume !(main_#t~post3#1 < 50);havoc main_#t~post3#1; {697#false} is VALID [2022-02-20 17:19:38,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#(< ~counter~0 50)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {791#(< |ULTIMATE.start_main_#t~post3#1| 50)} is VALID [2022-02-20 17:19:38,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {795#(< ~counter~0 50)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {795#(< ~counter~0 50)} is VALID [2022-02-20 17:19:38,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {795#(< ~counter~0 50)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {795#(< ~counter~0 50)} is VALID [2022-02-20 17:19:38,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#(< ~counter~0 49)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {795#(< ~counter~0 50)} is VALID [2022-02-20 17:19:38,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {805#(< ~counter~0 49)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {805#(< ~counter~0 49)} is VALID [2022-02-20 17:19:38,024 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {696#true} {805#(< ~counter~0 49)} #75#return; {805#(< ~counter~0 49)} is VALID [2022-02-20 17:19:38,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {696#true} assume true; {696#true} is VALID [2022-02-20 17:19:38,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#true} assume !(0 == ~cond); {696#true} is VALID [2022-02-20 17:19:38,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {696#true} ~cond := #in~cond; {696#true} is VALID [2022-02-20 17:19:38,025 INFO L272 TraceCheckUtils]: 7: Hoare triple {805#(< ~counter~0 49)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {696#true} is VALID [2022-02-20 17:19:38,025 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {696#true} {805#(< ~counter~0 49)} #73#return; {805#(< ~counter~0 49)} is VALID [2022-02-20 17:19:38,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#true} assume true; {696#true} is VALID [2022-02-20 17:19:38,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {696#true} assume !(0 == ~cond); {696#true} is VALID [2022-02-20 17:19:38,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {696#true} ~cond := #in~cond; {696#true} is VALID [2022-02-20 17:19:38,026 INFO L272 TraceCheckUtils]: 2: Hoare triple {805#(< ~counter~0 49)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {696#true} is VALID [2022-02-20 17:19:38,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#(< ~counter~0 49)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {805#(< ~counter~0 49)} is VALID [2022-02-20 17:19:38,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {696#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(9, 2);~counter~0 := 0; {805#(< ~counter~0 49)} is VALID [2022-02-20 17:19:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:38,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:38,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155266641] [2022-02-20 17:19:38,028 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:38,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731491615] [2022-02-20 17:19:38,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731491615] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:19:38,028 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:19:38,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:19:38,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536571275] [2022-02-20 17:19:38,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:19:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2022-02-20 17:19:38,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:38,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:38,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:38,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:19:38,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:19:38,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:19:38,076 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:38,425 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-02-20 17:19:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:19:38,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2022-02-20 17:19:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-02-20 17:19:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-02-20 17:19:38,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-02-20 17:19:38,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:38,520 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:19:38,520 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 17:19:38,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:38,521 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:38,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:19:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 17:19:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2022-02-20 17:19:38,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:38,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:38,534 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:38,534 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:38,537 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 17:19:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 17:19:38,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:38,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:38,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 57 states. [2022-02-20 17:19:38,539 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 57 states. [2022-02-20 17:19:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:38,542 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 17:19:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 17:19:38,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:38,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:38,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:38,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-02-20 17:19:38,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 24 [2022-02-20 17:19:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:38,547 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-20 17:19:38,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-20 17:19:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:19:38,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:38,548 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:38,575 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:19:38,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:38,764 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:38,764 INFO L85 PathProgramCache]: Analyzing trace with hash -450968108, now seen corresponding path program 1 times [2022-02-20 17:19:38,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:38,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493762720] [2022-02-20 17:19:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:38,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:38,782 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:38,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506502653] [2022-02-20 17:19:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:38,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:38,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:19:38,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:19:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:38,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:19:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:38,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:39,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {1108#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(9, 2);~counter~0 := 0; {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L272 TraceCheckUtils]: 2: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {1108#true} ~cond := #in~cond; {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {1108#true} assume !(0 == ~cond); {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1108#true} {1108#true} #73#return; {1108#true} is VALID [2022-02-20 17:19:39,599 INFO L272 TraceCheckUtils]: 7: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:39,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#true} ~cond := #in~cond; {1137#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:19:39,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1141#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:39,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1141#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:39,602 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1141#(not (= |assume_abort_if_not_#in~cond| 0))} {1108#true} #75#return; {1148#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} is VALID [2022-02-20 17:19:39,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1148#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:39,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:39,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:39,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:39,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:39,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:39,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:39,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:39,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:39,609 INFO L272 TraceCheckUtils]: 21: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:39,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1185#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:39,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {1185#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1109#false} is VALID [2022-02-20 17:19:39,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-02-20 17:19:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:19:39,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:40,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-02-20 17:19:40,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {1185#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1109#false} is VALID [2022-02-20 17:19:40,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1185#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:42,268 WARN L272 TraceCheckUtils]: 21: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-02-20 17:19:42,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:42,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:42,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:42,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:42,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:42,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:42,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} is VALID [2022-02-20 17:19:42,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} is VALID [2022-02-20 17:19:42,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {1108#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} is VALID [2022-02-20 17:19:42,273 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1108#true} {1108#true} #75#return; {1108#true} is VALID [2022-02-20 17:19:42,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-02-20 17:19:42,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#true} assume !(0 == ~cond); {1108#true} is VALID [2022-02-20 17:19:42,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#true} ~cond := #in~cond; {1108#true} is VALID [2022-02-20 17:19:42,273 INFO L272 TraceCheckUtils]: 7: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:42,273 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1108#true} {1108#true} #73#return; {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {1108#true} assume !(0 == ~cond); {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {1108#true} ~cond := #in~cond; {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L272 TraceCheckUtils]: 2: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {1108#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(9, 2);~counter~0 := 0; {1108#true} is VALID [2022-02-20 17:19:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:42,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:42,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493762720] [2022-02-20 17:19:42,275 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:42,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506502653] [2022-02-20 17:19:42,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506502653] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:19:42,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:19:42,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-20 17:19:42,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442595393] [2022-02-20 17:19:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:42,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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 25 [2022-02-20 17:19:42,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:42,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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:19:44,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:44,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:19:44,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:19:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:44,328 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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:19:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:54,464 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-20 17:19:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:19:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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 25 [2022-02-20 17:19:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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:19:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 17:19:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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:19:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 17:19:54,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-02-20 17:19:56,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:56,540 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:19:56,540 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:19:56,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:19:56,541 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:56,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 138 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-02-20 17:19:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:19:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-02-20 17:19:56,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:56,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:56,555 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:56,555 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:56,558 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 17:19:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 17:19:56,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:56,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:56,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 17:19:56,559 INFO L87 Difference]: Start difference. First operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 17:19:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:56,561 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 17:19:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 17:19:56,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:56,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:56,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:56,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-02-20 17:19:56,565 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 25 [2022-02-20 17:19:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:56,565 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-02-20 17:19:56,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 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:19:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 17:19:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:19:56,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:56,566 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:56,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:19:56,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:56,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash -452755568, now seen corresponding path program 1 times [2022-02-20 17:19:56,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:56,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854665123] [2022-02-20 17:19:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:56,797 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:56,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460103809] [2022-02-20 17:19:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:56,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:56,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:19:56,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:19:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:56,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:19:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:56,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:57,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#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(9, 2);~counter~0 := 0; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {1508#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,040 INFO L272 TraceCheckUtils]: 2: Hoare triple {1508#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {1508#(<= ~counter~0 0)} ~cond := #in~cond; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {1508#(<= ~counter~0 0)} assume !(0 == ~cond); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1508#(<= ~counter~0 0)} assume true; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,041 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1508#(<= ~counter~0 0)} {1508#(<= ~counter~0 0)} #73#return; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,042 INFO L272 TraceCheckUtils]: 7: Hoare triple {1508#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1508#(<= ~counter~0 0)} ~cond := #in~cond; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1508#(<= ~counter~0 0)} assume !(0 == ~cond); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {1508#(<= ~counter~0 0)} assume true; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,048 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1508#(<= ~counter~0 0)} {1508#(<= ~counter~0 0)} #75#return; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {1508#(<= ~counter~0 0)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:57,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1508#(<= ~counter~0 0)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1548#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:57,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {1548#(<= ~counter~0 1)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1548#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:57,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1548#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:57,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {1548#(<= ~counter~0 1)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1558#(<= ~counter~0 2)} is VALID [2022-02-20 17:19:57,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {1558#(<= ~counter~0 2)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1558#(<= ~counter~0 2)} is VALID [2022-02-20 17:19:57,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {1558#(<= ~counter~0 2)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1558#(<= ~counter~0 2)} is VALID [2022-02-20 17:19:57,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {1558#(<= ~counter~0 2)} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1568#(<= |ULTIMATE.start_main_#t~post4#1| 2)} is VALID [2022-02-20 17:19:57,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {1568#(<= |ULTIMATE.start_main_#t~post4#1| 2)} assume !(main_#t~post4#1 < 50);havoc main_#t~post4#1; {1504#false} is VALID [2022-02-20 17:19:57,052 INFO L272 TraceCheckUtils]: 21: Hoare triple {1504#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1504#false} is VALID [2022-02-20 17:19:57,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-02-20 17:19:57,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-02-20 17:19:57,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-02-20 17:19:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:57,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:57,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-02-20 17:19:57,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-02-20 17:19:57,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-02-20 17:19:57,237 INFO L272 TraceCheckUtils]: 21: Hoare triple {1504#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1504#false} is VALID [2022-02-20 17:19:57,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#(< |ULTIMATE.start_main_#t~post4#1| 50)} assume !(main_#t~post4#1 < 50);havoc main_#t~post4#1; {1504#false} is VALID [2022-02-20 17:19:57,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {1600#(< ~counter~0 50)} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1596#(< |ULTIMATE.start_main_#t~post4#1| 50)} is VALID [2022-02-20 17:19:57,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {1600#(< ~counter~0 50)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1600#(< ~counter~0 50)} is VALID [2022-02-20 17:19:57,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {1600#(< ~counter~0 50)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1600#(< ~counter~0 50)} is VALID [2022-02-20 17:19:57,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {1610#(< ~counter~0 49)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1600#(< ~counter~0 50)} is VALID [2022-02-20 17:19:57,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {1610#(< ~counter~0 49)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1610#(< ~counter~0 49)} is VALID [2022-02-20 17:19:57,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {1610#(< ~counter~0 49)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {1610#(< ~counter~0 49)} is VALID [2022-02-20 17:19:57,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(< ~counter~0 48)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1610#(< ~counter~0 49)} is VALID [2022-02-20 17:19:57,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1620#(< ~counter~0 48)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1620#(< ~counter~0 48)} is VALID [2022-02-20 17:19:57,242 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1503#true} {1620#(< ~counter~0 48)} #75#return; {1620#(< ~counter~0 48)} is VALID [2022-02-20 17:19:57,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-02-20 17:19:57,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-02-20 17:19:57,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-02-20 17:19:57,243 INFO L272 TraceCheckUtils]: 7: Hoare triple {1620#(< ~counter~0 48)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1503#true} is VALID [2022-02-20 17:19:57,243 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1503#true} {1620#(< ~counter~0 48)} #73#return; {1620#(< ~counter~0 48)} is VALID [2022-02-20 17:19:57,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-02-20 17:19:57,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-02-20 17:19:57,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-02-20 17:19:57,244 INFO L272 TraceCheckUtils]: 2: Hoare triple {1620#(< ~counter~0 48)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1503#true} is VALID [2022-02-20 17:19:57,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#(< ~counter~0 48)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1620#(< ~counter~0 48)} is VALID [2022-02-20 17:19:57,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#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(9, 2);~counter~0 := 0; {1620#(< ~counter~0 48)} is VALID [2022-02-20 17:19:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:57,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:57,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854665123] [2022-02-20 17:19:57,251 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:57,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460103809] [2022-02-20 17:19:57,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460103809] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:19:57,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:19:57,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 17:19:57,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761233097] [2022-02-20 17:19:57,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:19:57,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 17:19:57,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:57,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:57,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:57,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:19:57,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:19:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:19:57,288 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:58,320 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2022-02-20 17:19:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:19:58,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 17:19:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-02-20 17:19:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-02-20 17:19:58,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 116 transitions. [2022-02-20 17:19:58,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:58,438 INFO L225 Difference]: With dead ends: 124 [2022-02-20 17:19:58,438 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:19:58,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:19:58,439 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:58,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 163 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:19:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:19:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2022-02-20 17:19:58,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:58,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:58,468 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:58,469 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:58,473 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-02-20 17:19:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-02-20 17:19:58,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:58,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:58,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand 117 states. [2022-02-20 17:19:58,475 INFO L87 Difference]: Start difference. First operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand 117 states. [2022-02-20 17:19:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:58,479 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-02-20 17:19:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-02-20 17:19:58,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:58,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:58,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:58,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-02-20 17:19:58,485 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 25 [2022-02-20 17:19:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:58,485 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-02-20 17:19:58,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-02-20 17:19:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:19:58,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:58,487 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:58,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 17:19:58,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:58,708 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -791365823, now seen corresponding path program 1 times [2022-02-20 17:19:58,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:58,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959000208] [2022-02-20 17:19:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:58,721 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:58,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768369695] [2022-02-20 17:19:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:58,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:58,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:19:58,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:19:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:58,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:19:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:58,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:58,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {2200#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(9, 2);~counter~0 := 0; {2200#true} is VALID [2022-02-20 17:19:58,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {2200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2200#true} is VALID [2022-02-20 17:19:58,873 INFO L272 TraceCheckUtils]: 2: Hoare triple {2200#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {2200#true} is VALID [2022-02-20 17:19:58,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {2200#true} ~cond := #in~cond; {2200#true} is VALID [2022-02-20 17:19:58,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {2200#true} assume !(0 == ~cond); {2200#true} is VALID [2022-02-20 17:19:58,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-02-20 17:19:58,877 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2200#true} {2200#true} #73#return; {2200#true} is VALID [2022-02-20 17:19:58,877 INFO L272 TraceCheckUtils]: 7: Hoare triple {2200#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2200#true} is VALID [2022-02-20 17:19:58,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#true} ~cond := #in~cond; {2200#true} is VALID [2022-02-20 17:19:58,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#true} assume !(0 == ~cond); {2200#true} is VALID [2022-02-20 17:19:58,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-02-20 17:19:58,878 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2200#true} {2200#true} #75#return; {2200#true} is VALID [2022-02-20 17:19:58,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {2200#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,885 INFO L272 TraceCheckUtils]: 18: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2200#true} is VALID [2022-02-20 17:19:58,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {2200#true} ~cond := #in~cond; {2200#true} is VALID [2022-02-20 17:19:58,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {2200#true} assume !(0 == ~cond); {2200#true} is VALID [2022-02-20 17:19:58,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-02-20 17:19:58,886 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2200#true} {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} #77#return; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:58,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !!(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296);main_~q~0#1 := 2 * main_~q~0#1;main_~b~0#1 := (if main_~b~0#1 % 4294967296 < 0 && 0 != main_~b~0#1 % 4294967296 % 2 then 1 + main_~b~0#1 % 4294967296 / 2 else main_~b~0#1 % 4294967296 / 2); {2201#false} is VALID [2022-02-20 17:19:58,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {2201#false} assume main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296;main_~q~0#1 := 1 + main_~q~0#1;main_~r~0#1 := main_~r~0#1 - main_~b~0#1; {2201#false} is VALID [2022-02-20 17:19:58,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {2201#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2201#false} is VALID [2022-02-20 17:19:58,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {2201#false} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {2201#false} is VALID [2022-02-20 17:19:58,888 INFO L272 TraceCheckUtils]: 27: Hoare triple {2201#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2201#false} is VALID [2022-02-20 17:19:58,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {2201#false} ~cond := #in~cond; {2201#false} is VALID [2022-02-20 17:19:58,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {2201#false} assume 0 == ~cond; {2201#false} is VALID [2022-02-20 17:19:58,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2022-02-20 17:19:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:58,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:19:58,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:58,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959000208] [2022-02-20 17:19:58,892 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:58,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768369695] [2022-02-20 17:19:58,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768369695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:19:58,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:19:58,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:19:58,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357349734] [2022-02-20 17:19:58,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 17:19:58,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:58,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:58,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:58,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:19:58,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:19:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:19:58,929 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:59,043 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2022-02-20 17:19:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:19:59,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 17:19:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 17:19:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 17:19:59,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 17:19:59,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:59,102 INFO L225 Difference]: With dead ends: 151 [2022-02-20 17:19:59,102 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 17:19:59,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:19:59,103 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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:19:59,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:19:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 17:19:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 17:19:59,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:59,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:59,137 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:59,138 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:59,141 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-02-20 17:19:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-02-20 17:19:59,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:59,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:59,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 96 states. [2022-02-20 17:19:59,144 INFO L87 Difference]: Start difference. First operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 96 states. [2022-02-20 17:19:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:59,148 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-02-20 17:19:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-02-20 17:19:59,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:59,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:59,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:59,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-02-20 17:19:59,154 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-02-20 17:19:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:59,154 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-02-20 17:19:59,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-02-20 17:19:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:19:59,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:59,158 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:59,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:19:59,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:59,379 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1505101988, now seen corresponding path program 1 times [2022-02-20 17:19:59,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:59,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253782080] [2022-02-20 17:19:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:59,401 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:59,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879557403] [2022-02-20 17:19:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:59,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:59,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:59,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:19:59,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:19:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:59,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:19:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:59,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:20:00,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {2804#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(9, 2);~counter~0 := 0; {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L272 TraceCheckUtils]: 2: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2804#true} {2804#true} #73#return; {2804#true} is VALID [2022-02-20 17:20:00,151 INFO L272 TraceCheckUtils]: 7: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {2804#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {2804#true} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {2804#true} is VALID [2022-02-20 17:20:00,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:20:00,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:20:00,153 INFO L272 TraceCheckUtils]: 21: Hoare triple {2804#true} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:20:00,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {2804#true} ~cond := #in~cond; {2875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:20:00,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {2875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:20:00,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:20:00,155 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} {2804#true} #77#return; {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:20:00,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296); {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:20:00,156 INFO L272 TraceCheckUtils]: 27: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2893#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-02-20 17:20:00,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {2893#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2897#(= __VERIFIER_assert_~cond 1)} is VALID [2022-02-20 17:20:00,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {2897#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2805#false} is VALID [2022-02-20 17:20:00,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-02-20 17:20:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:20:00,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:20:02,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-02-20 17:20:02,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {2907#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2805#false} is VALID [2022-02-20 17:20:02,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2907#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:20:02,201 INFO L272 TraceCheckUtils]: 27: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:20:02,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296); {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:20:02,203 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} {2804#true} #77#return; {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:20:02,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:20:02,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {2929#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:20:02,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {2804#true} ~cond := #in~cond; {2929#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:20:02,204 INFO L272 TraceCheckUtils]: 21: Hoare triple {2804#true} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:20:02,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !!(main_#t~post4#1 < 50);havoc main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:20:02,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:20:02,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {2804#true} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {2804#true} is VALID [2022-02-20 17:20:02,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:02,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:02,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {2804#true} is VALID [2022-02-20 17:20:02,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 50);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:02,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:20:02,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {2804#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L272 TraceCheckUtils]: 7: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2804#true} {2804#true} #73#return; {2804#true} is VALID [2022-02-20 17:20:02,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:20:02,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:20:02,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:20:02,207 INFO L272 TraceCheckUtils]: 2: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:20:02,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2804#true} is VALID [2022-02-20 17:20:02,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {2804#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(9, 2);~counter~0 := 0; {2804#true} is VALID [2022-02-20 17:20:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:20:02,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:20:02,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253782080] [2022-02-20 17:20:02,208 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:20:02,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879557403] [2022-02-20 17:20:02,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879557403] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:20:02,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:20:02,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-02-20 17:20:02,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588428314] [2022-02-20 17:20:02,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:20:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-20 17:20:02,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:20:02,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:20:02,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:20:02,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:20:02,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:20:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:20:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:20:02,240 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:20:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:20:03,377 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-02-20 17:20:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:20:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-20 17:20:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:20:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:20:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-02-20 17:20:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:20:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-02-20 17:20:03,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-02-20 17:20:03,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:20:03,417 INFO L225 Difference]: With dead ends: 111 [2022-02-20 17:20:03,417 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 17:20:03,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:20:03,418 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:20:03,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:20:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 17:20:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 17:20:03,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:20:03,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:20:03,438 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:20:03,438 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:20:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:20:03,441 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2022-02-20 17:20:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-02-20 17:20:03,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:20:03,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:20:03,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 91 states. [2022-02-20 17:20:03,443 INFO L87 Difference]: Start difference. First operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 91 states. [2022-02-20 17:20:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:20:03,446 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2022-02-20 17:20:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-02-20 17:20:03,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:20:03,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:20:03,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:20:03,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:20:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:20:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-02-20 17:20:03,450 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 31 [2022-02-20 17:20:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:20:03,450 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-02-20 17:20:03,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:20:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-02-20 17:20:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 17:20:03,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:20:03,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:20:03,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:20:03,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:20:03,665 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:20:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:20:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash 675416052, now seen corresponding path program 1 times [2022-02-20 17:20:03,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:20:03,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548752450] [2022-02-20 17:20:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:20:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:20:03,677 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:20:03,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981840821] [2022-02-20 17:20:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:20:03,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:20:03,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:20:03,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:20:03,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process