./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.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/divbin2_unwindbound5.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 e46fdb43c1704e8aa9295c108b22e9521ffebb273e9060ca31abf40569948ab2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:17:57,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:17:57,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:17:57,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:17:57,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:17:57,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:17:57,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:17:57,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:17:57,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:17:57,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:17:57,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:17:57,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:17:57,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:17:57,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:17:57,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:17:57,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:17:57,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:17:57,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:17:57,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:17:57,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:17:57,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:17:57,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:17:57,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:17:57,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:17:57,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:17:57,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:17:57,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:17:57,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:17:57,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:17:57,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:17:57,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:17:57,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:17:57,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:17:57,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:17:57,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:17:57,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:17:57,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:17:57,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:17:57,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:17:57,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:17:57,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:17:57,912 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:17:57,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:17:57,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:17:57,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:17:57,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:17:57,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:17:57,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:17:57,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:17:57,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:17:57,938 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:17:57,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:17:57,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:17:57,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:17:57,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:17:57,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:17:57,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:17:57,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:17:57,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:17:57,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:17:57,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:17:57,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:17:57,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:17:57,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:17:57,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:17:57,942 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:17:57,942 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:17:57,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:17:57,942 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 -> e46fdb43c1704e8aa9295c108b22e9521ffebb273e9060ca31abf40569948ab2 [2022-02-20 17:17:58,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:17:58,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:17:58,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:17:58,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:17:58,111 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:17:58,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i [2022-02-20 17:17:58,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a947852/93a3d81ff3004dab85bf6f420ca8514e/FLAG9f90bb2f0 [2022-02-20 17:17:58,505 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:17:58,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i [2022-02-20 17:17:58,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a947852/93a3d81ff3004dab85bf6f420ca8514e/FLAG9f90bb2f0 [2022-02-20 17:17:58,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a947852/93a3d81ff3004dab85bf6f420ca8514e [2022-02-20 17:17:58,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:17:58,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:17:58,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:17:58,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:17:58,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:17:58,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c814d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58, skipping insertion in model container [2022-02-20 17:17:58,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:17:58,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:17:58,704 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/divbin2_unwindbound5.i[951,964] [2022-02-20 17:17:58,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:17:58,732 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:17:58,744 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/divbin2_unwindbound5.i[951,964] [2022-02-20 17:17:58,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:17:58,764 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:17:58,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58 WrapperNode [2022-02-20 17:17:58,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:17:58,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:17:58,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:17:58,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:17:58,770 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:17:58" (1/1) ... [2022-02-20 17:17:58,775 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:17:58" (1/1) ... [2022-02-20 17:17:58,792 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-02-20 17:17:58,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:17:58,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:17:58,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:17:58,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:17:58,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:17:58,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:17:58,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:17:58,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:17:58,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (1/1) ... [2022-02-20 17:17:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:17:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:58,860 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:17:58,866 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:17:58,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:17:58,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:17:58,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:17:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:17:58,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:17:58,930 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:17:58,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:17:59,070 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:17:59,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:17:59,074 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:17:59,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:17:59 BoogieIcfgContainer [2022-02-20 17:17:59,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:17:59,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:17:59,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:17:59,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:17:59,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:17:58" (1/3) ... [2022-02-20 17:17:59,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a12272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:17:59, skipping insertion in model container [2022-02-20 17:17:59,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:17:58" (2/3) ... [2022-02-20 17:17:59,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a12272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:17:59, skipping insertion in model container [2022-02-20 17:17:59,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:17:59" (3/3) ... [2022-02-20 17:17:59,096 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2022-02-20 17:17:59,100 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:17:59,100 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:17:59,137 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:17:59,152 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:17:59,153 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:17:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:17:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:17:59,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:59,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:59,173 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash 553144752, now seen corresponding path program 1 times [2022-02-20 17:17:59,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:59,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937726700] [2022-02-20 17:17:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:59,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {24#true} is VALID [2022-02-20 17:17:59,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {24#true} is VALID [2022-02-20 17:17:59,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-20 17:17:59,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 17:17:59,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#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)); {25#false} is VALID [2022-02-20 17:17:59,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:17:59,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-02-20 17:17:59,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:17:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:59,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:59,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937726700] [2022-02-20 17:17:59,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937726700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:59,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:59,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:17:59,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301837378] [2022-02-20 17:17:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:17:59,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:59,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:59,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:17:59,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:59,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:17:59,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:17:59,335 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,378 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2022-02-20 17:17:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:17:59,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:17:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:17:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:17:59,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2022-02-20 17:17:59,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:59,469 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:17:59,469 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:17:59,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:17:59,475 INFO L933 BasicCegarLoop]: 26 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, 26 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:17:59,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:17:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:17:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:17:59,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:59,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,499 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,500 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,509 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-20 17:17:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-20 17:17:59,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:59,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:59,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:17:59,511 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:17:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,513 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-20 17:17:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-20 17:17:59,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:59,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:59,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:59,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-02-20 17:17:59,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2022-02-20 17:17:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:59,519 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-20 17:17:59,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-20 17:17:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:17:59,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:59,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:59,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:17:59,522 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:59,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -803059042, now seen corresponding path program 1 times [2022-02-20 17:17:59,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:59,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020336005] [2022-02-20 17:17:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:59,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:17:59,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(= ~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~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:17:59,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(= ~counter~0 0)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {132#(= |ULTIMATE.start_main_#t~post2#1| 0)} is VALID [2022-02-20 17:17:59,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#(= |ULTIMATE.start_main_#t~post2#1| 0)} assume !(main_#t~post2#1 < 5);havoc main_#t~post2#1; {130#false} is VALID [2022-02-20 17:17:59,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#false} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {130#false} is VALID [2022-02-20 17:17:59,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#false} assume !(main_#t~post3#1 < 5);havoc main_#t~post3#1; {130#false} is VALID [2022-02-20 17:17:59,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {130#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)); {130#false} is VALID [2022-02-20 17:17:59,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} ~cond := #in~cond; {130#false} is VALID [2022-02-20 17:17:59,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#false} assume 0 == ~cond; {130#false} is VALID [2022-02-20 17:17:59,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-02-20 17:17:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:59,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:59,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020336005] [2022-02-20 17:17:59,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020336005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:59,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:59,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:17:59,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859980603] [2022-02-20 17:17:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:59,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:17:59,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:59,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:59,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:17:59,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:17:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:17:59,600 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,649 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-20 17:17:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:17:59,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:17:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-02-20 17:17:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-02-20 17:17:59,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-02-20 17:17:59,684 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:17:59,684 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:17:59,685 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:17:59,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:17:59,686 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 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:17:59,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:17:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:17:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:17:59,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:59,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,689 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,690 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,691 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 17:17:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 17:17:59,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:59,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:59,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 17:17:59,692 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 17:17:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,693 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 17:17:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 17:17:59,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:59,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:59,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:59,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:17:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-20 17:17:59,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2022-02-20 17:17:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:59,695 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-20 17:17:59,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 17:17:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:17:59,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:59,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:59,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:17:59,697 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash 549278495, now seen corresponding path program 1 times [2022-02-20 17:17:59,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:59,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497795068] [2022-02-20 17:17:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:59,709 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:59,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567139131] [2022-02-20 17:17:59,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:59,711 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:17:59,743 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:17:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:59,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:17:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:59,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:59,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {241#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:59,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(<= ~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~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {241#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:59,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#(<= ~counter~0 0)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {248#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:59,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#(<= ~counter~0 1)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {248#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:59,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {248#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {248#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:59,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#(<= ~counter~0 1)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {258#(<= |ULTIMATE.start_main_#t~post3#1| 1)} is VALID [2022-02-20 17:17:59,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#(<= |ULTIMATE.start_main_#t~post3#1| 1)} assume !(main_#t~post3#1 < 5);havoc main_#t~post3#1; {237#false} is VALID [2022-02-20 17:17:59,889 INFO L272 TraceCheckUtils]: 7: Hoare triple {237#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)); {237#false} is VALID [2022-02-20 17:17:59,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-02-20 17:17:59,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-02-20 17:17:59,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-02-20 17:17:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:59,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:17:59,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:59,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497795068] [2022-02-20 17:17:59,890 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:59,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567139131] [2022-02-20 17:17:59,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567139131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:59,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:59,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:17:59,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821365985] [2022-02-20 17:17:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:59,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:17:59,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:59,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:59,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:17:59,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:17:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:17:59,902 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:59,977 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 17:17:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:17:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:17:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:17:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:17:59,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:18:00,006 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:18:00,007 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:18:00,007 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:18:00,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:18:00,008 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:00,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:18:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-20 17:18:00,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:00,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:00,017 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:00,018 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,021 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-20 17:18:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 17:18:00,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:00,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:00,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-02-20 17:18:00,022 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-02-20 17:18:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,028 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-20 17:18:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 17:18:00,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:00,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:00,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:00,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 17:18:00,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2022-02-20 17:18:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:00,032 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 17:18:00,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 17:18:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:18:00,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:00,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:00,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:18:00,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:00,252 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 551065955, now seen corresponding path program 1 times [2022-02-20 17:18:00,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:00,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781958058] [2022-02-20 17:18:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:00,263 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:00,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048060256] [2022-02-20 17:18:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:00,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:00,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:00,265 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:18:00,266 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:18:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:00,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:18:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:00,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:00,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {384#true} is VALID [2022-02-20 17:18:00,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {384#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {392#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |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:18:00,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {392#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |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:18:00,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {392#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |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:18:00,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |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); {402#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |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:18:00,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |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; {402#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |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:18:00,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post3#1 < 5);havoc main_#t~post3#1; {402#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |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:18:00,569 INFO L272 TraceCheckUtils]: 7: Hoare triple {402#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |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)); {412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:00,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:00,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:18:00,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:18:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:00,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:00,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:00,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781958058] [2022-02-20 17:18:00,571 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:00,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048060256] [2022-02-20 17:18:00,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048060256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:00,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:00,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:18:00,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31191860] [2022-02-20 17:18:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:18:00,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:00,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:00,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:00,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:18:00,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:00,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:18:00,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:18:00,593 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,720 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 17:18:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:18:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:18:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:18:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:18:00,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:18:00,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:00,756 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:18:00,756 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:18:00,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:18:00,758 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:00,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:18:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:18:00,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:00,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:00,769 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:00,769 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,774 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 17:18:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 17:18:00,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:00,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:00,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 17:18:00,779 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 17:18:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,782 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 17:18:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 17:18:00,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:00,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:00,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:00,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 17:18:00,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2022-02-20 17:18:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:00,786 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 17:18:00,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 17:18:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:18:00,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:00,790 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:00,818 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:18:01,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:18:01,019 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1647533572, now seen corresponding path program 1 times [2022-02-20 17:18:01,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:01,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746226612] [2022-02-20 17:18:01,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:01,032 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:01,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394766010] [2022-02-20 17:18:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:01,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:01,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:01,034 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:18:01,035 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:18:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:01,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:18:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:01,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:01,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {559#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:01,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {559#(<= ~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~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {559#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:01,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {559#(<= ~counter~0 0)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {566#(<= ~counter~0 1)} is VALID [2022-02-20 17:18:01,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {566#(<= ~counter~0 1)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {566#(<= ~counter~0 1)} is VALID [2022-02-20 17:18:01,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {566#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {566#(<= ~counter~0 1)} is VALID [2022-02-20 17:18:01,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#(<= ~counter~0 1)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {576#(<= |ULTIMATE.start_main_#t~post2#1| 1)} is VALID [2022-02-20 17:18:01,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(<= |ULTIMATE.start_main_#t~post2#1| 1)} assume !(main_#t~post2#1 < 5);havoc main_#t~post2#1; {555#false} is VALID [2022-02-20 17:18:01,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#false} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {555#false} is VALID [2022-02-20 17:18:01,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#false} assume !(main_#t~post3#1 < 5);havoc main_#t~post3#1; {555#false} is VALID [2022-02-20 17:18:01,129 INFO L272 TraceCheckUtils]: 9: Hoare triple {555#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)); {555#false} is VALID [2022-02-20 17:18:01,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-02-20 17:18:01,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-02-20 17:18:01,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-02-20 17:18:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:01,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:18:01,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-02-20 17:18:01,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-02-20 17:18:01,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-02-20 17:18:01,199 INFO L272 TraceCheckUtils]: 9: Hoare triple {555#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)); {555#false} is VALID [2022-02-20 17:18:01,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#false} assume !(main_#t~post3#1 < 5);havoc main_#t~post3#1; {555#false} is VALID [2022-02-20 17:18:01,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#false} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {555#false} is VALID [2022-02-20 17:18:01,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(< |ULTIMATE.start_main_#t~post2#1| 5)} assume !(main_#t~post2#1 < 5);havoc main_#t~post2#1; {555#false} is VALID [2022-02-20 17:18:01,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#(< ~counter~0 5)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {616#(< |ULTIMATE.start_main_#t~post2#1| 5)} is VALID [2022-02-20 17:18:01,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {620#(< ~counter~0 5)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {620#(< ~counter~0 5)} is VALID [2022-02-20 17:18:01,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {620#(< ~counter~0 5)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {620#(< ~counter~0 5)} is VALID [2022-02-20 17:18:01,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {630#(< ~counter~0 4)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {620#(< ~counter~0 5)} is VALID [2022-02-20 17:18:01,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(< ~counter~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {630#(< ~counter~0 4)} is VALID [2022-02-20 17:18:01,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {630#(< ~counter~0 4)} is VALID [2022-02-20 17:18:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:01,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:01,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746226612] [2022-02-20 17:18:01,208 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:01,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394766010] [2022-02-20 17:18:01,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394766010] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:18:01,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:18:01,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 17:18:01,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534663657] [2022-02-20 17:18:01,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:18:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:18:01,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:01,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:01,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:01,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:18:01,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:18:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:18:01,224 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:01,396 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-02-20 17:18:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:18:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:18:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-02-20 17:18:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-02-20 17:18:01,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2022-02-20 17:18:01,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:01,474 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:18:01,474 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:18:01,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:18:01,475 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:01,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 107 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:18:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-02-20 17:18:01,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:01,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:01,482 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:01,482 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:01,484 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:18:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:18:01,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:01,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:01,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 50 states. [2022-02-20 17:18:01,485 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 50 states. [2022-02-20 17:18:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:01,486 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:18:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:18:01,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:01,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:01,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:01,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-02-20 17:18:01,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2022-02-20 17:18:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:01,492 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-02-20 17:18:01,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-02-20 17:18:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:18:01,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:01,493 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:01,511 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:18:01,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:01,709 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash -791761799, now seen corresponding path program 1 times [2022-02-20 17:18:01,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:01,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889011107] [2022-02-20 17:18:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:01,721 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:01,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396521010] [2022-02-20 17:18:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:01,722 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:18:01,737 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:18:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:01,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:18:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:01,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {866#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {871#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:01,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#(<= ~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~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {871#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:01,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#(<= ~counter~0 0)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {878#(<= ~counter~0 1)} is VALID [2022-02-20 17:18:01,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {878#(<= ~counter~0 1)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {878#(<= ~counter~0 1)} is VALID [2022-02-20 17:18:01,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {878#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {878#(<= ~counter~0 1)} is VALID [2022-02-20 17:18:01,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {878#(<= ~counter~0 1)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {888#(<= ~counter~0 2)} is VALID [2022-02-20 17:18:01,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {888#(<= ~counter~0 2)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {888#(<= ~counter~0 2)} is VALID [2022-02-20 17:18:01,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {888#(<= ~counter~0 2)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {888#(<= ~counter~0 2)} is VALID [2022-02-20 17:18:01,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(<= ~counter~0 2)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {898#(<= |ULTIMATE.start_main_#t~post3#1| 2)} is VALID [2022-02-20 17:18:01,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(<= |ULTIMATE.start_main_#t~post3#1| 2)} assume !(main_#t~post3#1 < 5);havoc main_#t~post3#1; {867#false} is VALID [2022-02-20 17:18:01,846 INFO L272 TraceCheckUtils]: 10: Hoare triple {867#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)); {867#false} is VALID [2022-02-20 17:18:01,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-02-20 17:18:01,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-02-20 17:18:01,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-02-20 17:18:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:01,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:18:01,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-02-20 17:18:01,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-02-20 17:18:01,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-02-20 17:18:01,941 INFO L272 TraceCheckUtils]: 10: Hoare triple {867#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)); {867#false} is VALID [2022-02-20 17:18:01,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {926#(< |ULTIMATE.start_main_#t~post3#1| 5)} assume !(main_#t~post3#1 < 5);havoc main_#t~post3#1; {867#false} is VALID [2022-02-20 17:18:01,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(< ~counter~0 5)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {926#(< |ULTIMATE.start_main_#t~post3#1| 5)} is VALID [2022-02-20 17:18:01,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(< ~counter~0 5)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {930#(< ~counter~0 5)} is VALID [2022-02-20 17:18:01,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(< ~counter~0 5)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {930#(< ~counter~0 5)} is VALID [2022-02-20 17:18:01,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {940#(< ~counter~0 4)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {930#(< ~counter~0 5)} is VALID [2022-02-20 17:18:01,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {940#(< ~counter~0 4)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {940#(< ~counter~0 4)} is VALID [2022-02-20 17:18:01,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {940#(< ~counter~0 4)} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {940#(< ~counter~0 4)} is VALID [2022-02-20 17:18:01,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {888#(<= ~counter~0 2)} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {940#(< ~counter~0 4)} is VALID [2022-02-20 17:18:01,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {888#(<= ~counter~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {888#(<= ~counter~0 2)} is VALID [2022-02-20 17:18:01,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {866#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {888#(<= ~counter~0 2)} is VALID [2022-02-20 17:18:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:01,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:01,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889011107] [2022-02-20 17:18:01,946 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:01,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396521010] [2022-02-20 17:18:01,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396521010] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:18:01,947 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:18:01,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 17:18:01,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462290963] [2022-02-20 17:18:01,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:18:01,947 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 17:18:01,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:01,948 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:01,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:01,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:18:01,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:18:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:18:01,963 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:02,118 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-02-20 17:18:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:18:02,118 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 17:18:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:02,119 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-02-20 17:18:02,121 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-02-20 17:18:02,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2022-02-20 17:18:02,188 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:18:02,189 INFO L225 Difference]: With dead ends: 72 [2022-02-20 17:18:02,189 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 17:18:02,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:18:02,190 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:02,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 108 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 17:18:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-02-20 17:18:02,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:02,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:18:02,204 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:18:02,204 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:18:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:02,206 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-20 17:18:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-02-20 17:18:02,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:02,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:02,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 65 states. [2022-02-20 17:18:02,207 INFO L87 Difference]: Start difference. First operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 65 states. [2022-02-20 17:18:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:02,209 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-20 17:18:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-02-20 17:18:02,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:02,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:02,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:02,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:18:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-02-20 17:18:02,211 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 14 [2022-02-20 17:18:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:02,211 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-02-20 17:18:02,211 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-02-20 17:18:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:18:02,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:02,212 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:02,229 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:18:02,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:02,429 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -789974339, now seen corresponding path program 1 times [2022-02-20 17:18:02,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:02,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868105757] [2022-02-20 17:18:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:02,442 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:02,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128779887] [2022-02-20 17:18:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:02,443 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:18:02,444 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:18:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:02,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:18:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:02,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:02,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {1258#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1258#true} is VALID [2022-02-20 17:18:02,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1266#(and (= |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:18:02,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {1266#(and (= |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:18:02,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {1266#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {1266#(and (= |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:18:02,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {1266#(and (= |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);main_~b~0#1 := 2 * main_~b~0#1; {1266#(and (= |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:18:02,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {1266#(and (= |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:18:02,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {1266#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {1266#(and (= |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:18:02,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#(and (= |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); {1266#(and (= |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:18:02,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(and (= |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; {1266#(and (= |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:18:02,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1266#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post3#1 < 5);havoc main_#t~post3#1; {1266#(and (= |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:18:02,570 INFO L272 TraceCheckUtils]: 10: Hoare triple {1266#(and (= |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)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:02,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:02,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-02-20 17:18:02,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-02-20 17:18:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:18:02,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:02,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:02,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868105757] [2022-02-20 17:18:02,571 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:02,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128779887] [2022-02-20 17:18:02,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128779887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:02,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:02,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:18:02,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333890276] [2022-02-20 17:18:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:02,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 17:18:02,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:02,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:02,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:18:02,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:18:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:18:02,582 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:02,675 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-02-20 17:18:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:18:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 17:18:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 17:18:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 17:18:02,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-02-20 17:18:02,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:02,707 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:18:02,707 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:18:02,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:18:02,708 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:02,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:18:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-02-20 17:18:02,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:02,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:18:02,727 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:18:02,727 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:18:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:02,729 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-02-20 17:18:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-02-20 17:18:02,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:02,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:02,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-02-20 17:18:02,730 INFO L87 Difference]: Start difference. First operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-02-20 17:18:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:02,732 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-02-20 17:18:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-02-20 17:18:02,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:02,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:02,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:02,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:18:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2022-02-20 17:18:02,735 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 14 [2022-02-20 17:18:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:02,735 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2022-02-20 17:18:02,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-02-20 17:18:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:18:02,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:02,736 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:02,753 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:18:02,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:02,952 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2118336314, now seen corresponding path program 1 times [2022-02-20 17:18:02,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:02,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196941968] [2022-02-20 17:18:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:03,003 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:03,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177281558] [2022-02-20 17:18:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:03,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:03,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:03,005 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:18:03,006 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:18:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:03,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:18:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:03,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:03,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {1711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {1711#true} is VALID [2022-02-20 17:18:03,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#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 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:03,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} main_#t~post2#1 := ~counter~0;~counter~0 := 1 + main_#t~post2#1; {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:03,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_#t~post2#1 < 5);havoc main_#t~post2#1; {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:03,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:03,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:03,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_#t~post3#1 < 5);havoc main_#t~post3#1; {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:03,112 INFO L272 TraceCheckUtils]: 7: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 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)); {1711#true} is VALID [2022-02-20 17:18:03,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {1711#true} ~cond := #in~cond; {1711#true} is VALID [2022-02-20 17:18:03,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {1711#true} assume !(0 == ~cond); {1711#true} is VALID [2022-02-20 17:18:03,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-02-20 17:18:03,113 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1711#true} {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #62#return; {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:05,271 WARN L290 TraceCheckUtils]: 12: Hoare triple {1719#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 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); {1712#false} is UNKNOWN [2022-02-20 17:18:05,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#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; {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#false} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} assume !!(main_#t~post3#1 < 5);havoc main_#t~post3#1; {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L272 TraceCheckUtils]: 16: Hoare triple {1712#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)); {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-02-20 17:18:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:05,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:05,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:05,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196941968] [2022-02-20 17:18:05,273 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:05,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177281558] [2022-02-20 17:18:05,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177281558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:05,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:05,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:18:05,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822372032] [2022-02-20 17:18:05,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 17:18:05,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:05,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:05,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:05,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:18:05,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:05,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:18:05,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:18:05,302 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:07,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:18:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:07,531 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2022-02-20 17:18:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:18:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 17:18:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 17:18:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 17:18:07,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 17:18:07,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:07,575 INFO L225 Difference]: With dead ends: 137 [2022-02-20 17:18:07,575 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:18:07,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:18:07,576 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:07,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 17:18:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:18:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-02-20 17:18:07,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:07,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:18:07,589 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:18:07,590 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:18:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:07,591 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-02-20 17:18:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-02-20 17:18:07,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:07,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:07,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 67 states. [2022-02-20 17:18:07,592 INFO L87 Difference]: Start difference. First operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 67 states. [2022-02-20 17:18:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:07,593 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-02-20 17:18:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-02-20 17:18:07,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:07,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:07,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:07,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:18:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-02-20 17:18:07,596 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 20 [2022-02-20 17:18:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:07,596 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-02-20 17:18:07,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:18:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-02-20 17:18:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:18:07,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:07,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:07,616 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:18:07,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:07,810 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1149777120, now seen corresponding path program 1 times [2022-02-20 17:18:07,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:07,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843110152] [2022-02-20 17:18:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:07,825 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:07,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054685200] [2022-02-20 17:18:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:07,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:07,827 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:18:07,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process