./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb7e704db84b45f8c7f1cb386fc610e1107f57c6e67c0a3b2af510d7426cfd4f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:16:38,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:38,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:38,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:38,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:38,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:38,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:38,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:38,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:38,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:38,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:38,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:38,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:38,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:38,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:38,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:38,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:38,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:38,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:38,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:38,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:38,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:38,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:38,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:38,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:38,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:38,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:38,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:38,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:38,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:38,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:38,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:38,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:38,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:38,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:38,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:38,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:38,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:38,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:38,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:38,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:38,143 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:16:38,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:38,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:38,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:38,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:38,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:38,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:38,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:38,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:38,167 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:38,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:38,168 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:38,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:38,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:38,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:38,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:38,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:38,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:38,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:38,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:38,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:38,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:38,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:38,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:38,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:38,172 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:38,172 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:38,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:38,172 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 -> eb7e704db84b45f8c7f1cb386fc610e1107f57c6e67c0a3b2af510d7426cfd4f [2022-02-20 17:16:38,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:38,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:38,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:38,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:38,409 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:38,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-02-20 17:16:38,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6493bfe5b/03a3b0b5828d411b9a1e0aa13457790e/FLAGb4308643f [2022-02-20 17:16:38,798 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:38,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-02-20 17:16:38,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6493bfe5b/03a3b0b5828d411b9a1e0aa13457790e/FLAGb4308643f [2022-02-20 17:16:38,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6493bfe5b/03a3b0b5828d411b9a1e0aa13457790e [2022-02-20 17:16:38,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:38,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:38,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:38,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:38,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:38,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:38" (1/1) ... [2022-02-20 17:16:38,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4645dff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:38, skipping insertion in model container [2022-02-20 17:16:38,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:38" (1/1) ... [2022-02-20 17:16:38,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:38,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:38,964 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/dijkstra-u_unwindbound5.c[525,538] [2022-02-20 17:16:39,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:39,007 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:39,019 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/dijkstra-u_unwindbound5.c[525,538] [2022-02-20 17:16:39,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:39,045 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:39,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39 WrapperNode [2022-02-20 17:16:39,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:39,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:39,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:39,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:39,052 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:16:39" (1/1) ... [2022-02-20 17:16:39,056 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:16:39" (1/1) ... [2022-02-20 17:16:39,085 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-02-20 17:16:39,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:39,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:39,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:39,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:39,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:39,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:39,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:39,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:39,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (1/1) ... [2022-02-20 17:16:39,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:39,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:39,141 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:16:39,143 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:16:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:39,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:39,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:39,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:39,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:39,226 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:39,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:39,383 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:39,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:39,388 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:39,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:39 BoogieIcfgContainer [2022-02-20 17:16:39,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:39,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:39,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:39,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:39,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:38" (1/3) ... [2022-02-20 17:16:39,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5823c139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:39, skipping insertion in model container [2022-02-20 17:16:39,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:39" (2/3) ... [2022-02-20 17:16:39,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5823c139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:39, skipping insertion in model container [2022-02-20 17:16:39,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:39" (3/3) ... [2022-02-20 17:16:39,416 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.c [2022-02-20 17:16:39,419 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:39,419 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:39,472 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:39,477 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:16:39,477 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:16:39,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:39,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:39,500 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2022-02-20 17:16:39,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:39,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647722302] [2022-02-20 17:16:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:39,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-02-20 17:16:39,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {33#true} is VALID [2022-02-20 17:16:39,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {34#false} is VALID [2022-02-20 17:16:39,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {34#false} is VALID [2022-02-20 17:16:39,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:39,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:39,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-02-20 17:16:39,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-02-20 17:16:39,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-02-20 17:16:39,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 17:16:39,657 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:16:39,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:39,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647722302] [2022-02-20 17:16:39,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647722302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:39,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:39,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:39,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13217488] [2022-02-20 17:16:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:16:39,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:39,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:39,691 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:16:39,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:39,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:39,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:39,710 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:39,976 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2022-02-20 17:16:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:39,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:16:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:40,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-20 17:16:40,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:40,154 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:16:40,154 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:16:40,157 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:16:40,161 INFO L933 BasicCegarLoop]: 42 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, 42 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:16:40,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:16:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:16:40,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:40,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:40,190 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:40,191 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:40,197 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:40,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:40,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:40,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 26 states. [2022-02-20 17:16:40,200 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 26 states. [2022-02-20 17:16:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:40,204 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:40,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:40,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:40,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:40,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-02-20 17:16:40,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2022-02-20 17:16:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:40,214 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2022-02-20 17:16:40,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:16:40,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:40,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:40,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:40,216 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2022-02-20 17:16:40,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:40,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111203829] [2022-02-20 17:16:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:40,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:40,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:40,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:40,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:40,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:16:40,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 5);havoc main_#t~post5#1; {208#false} is VALID [2022-02-20 17:16:40,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:40,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#false} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:40,296 INFO L272 TraceCheckUtils]: 8: Hoare triple {208#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {208#false} is VALID [2022-02-20 17:16:40,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 17:16:40,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2022-02-20 17:16:40,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 17:16:40,297 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:16:40,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:40,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111203829] [2022-02-20 17:16:40,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111203829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:40,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:40,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:16:40,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676245412] [2022-02-20 17:16:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:16:40,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:40,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:40,309 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:16:40,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:16:40,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:16:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:16:40,311 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:45,728 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-02-20 17:16:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:16:45,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:16:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:45,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-02-20 17:16:45,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:45,797 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:16:45,798 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:16:45,798 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:16:45,799 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 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:16:45,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:16:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:16:45,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:45,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:45,803 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:45,804 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:45,805 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:45,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:45,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:45,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 28 states. [2022-02-20 17:16:45,807 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 28 states. [2022-02-20 17:16:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:45,809 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:45,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:45,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:45,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:45,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-02-20 17:16:45,812 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2022-02-20 17:16:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:45,812 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-02-20 17:16:45,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:45,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:45,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:45,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:16:45,814 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2022-02-20 17:16:45,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:45,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921415069] [2022-02-20 17:16:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:45,827 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:45,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252592504] [2022-02-20 17:16:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:45,830 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:16:45,831 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:16:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:45,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:16:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:45,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:45,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {383#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:45,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {383#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:45,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:45,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {396#(<= ~counter~0 1)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:45,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {406#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:16:45,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {379#false} is VALID [2022-02-20 17:16:45,971 INFO L272 TraceCheckUtils]: 9: Hoare triple {379#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {379#false} is VALID [2022-02-20 17:16:45,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#false} ~cond := #in~cond; {379#false} is VALID [2022-02-20 17:16:45,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#false} assume 0 == ~cond; {379#false} is VALID [2022-02-20 17:16:45,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-02-20 17:16:45,972 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:16:45,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:45,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:45,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921415069] [2022-02-20 17:16:45,973 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:45,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252592504] [2022-02-20 17:16:45,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252592504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:45,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:45,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:16:45,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490254490] [2022-02-20 17:16:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:45,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:16:45,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:45,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:16:45,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:45,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:46,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:46,002 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:16:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:59,940 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-20 17:16:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:16:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:16:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:16:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:16:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:16:59,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-02-20 17:16:59,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:59,991 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:16:59,991 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:16:59,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:16:59,992 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 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:16:59,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:16:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 17:16:59,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:59,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:59,996 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:59,996 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:59,998 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-20 17:16:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2022-02-20 17:16:59,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:59,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:59,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-02-20 17:16:59,999 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-02-20 17:17:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:00,001 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-20 17:17:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2022-02-20 17:17:00,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:00,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:00,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:00,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:17:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2022-02-20 17:17:00,003 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 13 [2022-02-20 17:17:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:00,003 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-02-20 17:17:00,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2022-02-20 17:17:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:17:00,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:00,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:00,023 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:17:00,219 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:17:00,220 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2022-02-20 17:17:00,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:00,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233619174] [2022-02-20 17:17:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:00,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {586#true} is VALID [2022-02-20 17:17:00,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {586#true} is VALID [2022-02-20 17:17:00,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume !(0 == assume_abort_if_not_~cond#1); {586#true} is VALID [2022-02-20 17:17:00,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {586#true} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:00,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:00,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:00,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:00,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:00,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:00,435 INFO L272 TraceCheckUtils]: 9: Hoare triple {589#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {590#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:17:00,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {590#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {591#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:17:00,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {591#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {587#false} is VALID [2022-02-20 17:17:00,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-02-20 17:17:00,436 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:00,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:00,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233619174] [2022-02-20 17:17:00,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233619174] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:00,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:00,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:17:00,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819333980] [2022-02-20 17:17:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:17:00,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:00,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:00,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:00,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:17:00,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:00,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:17:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:17:00,454 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:03,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:17:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:21,742 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2022-02-20 17:17:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:17:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:17:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 17:17:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 17:17:21,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2022-02-20 17:17:21,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:21,842 INFO L225 Difference]: With dead ends: 64 [2022-02-20 17:17:21,842 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:17:21,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:17:21,843 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:21,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 181 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-02-20 17:17:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:17:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-02-20 17:17:21,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:21,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:21,861 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:21,862 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:21,864 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-20 17:17:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-20 17:17:21,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:21,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:21,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 45 states. [2022-02-20 17:17:21,865 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 45 states. [2022-02-20 17:17:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:21,867 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-20 17:17:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-20 17:17:21,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:21,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:21,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:21,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-02-20 17:17:21,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2022-02-20 17:17:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:21,870 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-02-20 17:17:21,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-02-20 17:17:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:17:21,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:21,871 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:21,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:17:21,872 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 84493759, now seen corresponding path program 1 times [2022-02-20 17:17:21,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:21,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336576846] [2022-02-20 17:17:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:21,883 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:21,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689387768] [2022-02-20 17:17:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:21,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:21,884 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:17:21,885 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:17:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:21,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:17:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:21,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:22,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:22,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:22,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:22,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:22,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {850#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:22,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:22,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:22,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:17:22,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 5);havoc main_#t~post5#1; {846#false} is VALID [2022-02-20 17:17:22,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:22,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#false} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:22,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {846#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {846#false} is VALID [2022-02-20 17:17:22,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-02-20 17:17:22,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-02-20 17:17:22,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-02-20 17:17:22,019 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:17:22,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:17:22,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-02-20 17:17:22,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-02-20 17:17:22,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-02-20 17:17:22,099 INFO L272 TraceCheckUtils]: 11: Hoare triple {846#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {846#false} is VALID [2022-02-20 17:17:22,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#false} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:22,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:22,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#(< |ULTIMATE.start_main_#t~post5#1| 5)} assume !(main_#t~post5#1 < 5);havoc main_#t~post5#1; {846#false} is VALID [2022-02-20 17:17:22,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#(< ~counter~0 5)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {913#(< |ULTIMATE.start_main_#t~post5#1| 5)} is VALID [2022-02-20 17:17:22,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#(< ~counter~0 5)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {917#(< ~counter~0 5)} is VALID [2022-02-20 17:17:22,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#(< ~counter~0 5)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {917#(< ~counter~0 5)} is VALID [2022-02-20 17:17:22,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {927#(< ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {917#(< ~counter~0 5)} is VALID [2022-02-20 17:17:22,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {927#(< ~counter~0 4)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {927#(< ~counter~0 4)} is VALID [2022-02-20 17:17:22,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {927#(< ~counter~0 4)} assume !(0 == assume_abort_if_not_~cond#1); {927#(< ~counter~0 4)} is VALID [2022-02-20 17:17:22,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#(< ~counter~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {927#(< ~counter~0 4)} is VALID [2022-02-20 17:17:22,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {927#(< ~counter~0 4)} is VALID [2022-02-20 17:17:22,103 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:17:22,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:22,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336576846] [2022-02-20 17:17:22,104 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:22,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689387768] [2022-02-20 17:17:22,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689387768] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:17:22,104 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:17:22,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 17:17:22,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973544441] [2022-02-20 17:17:22,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:17:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 15 [2022-02-20 17:17:22,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:22,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:22,121 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:17:22,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:17:22,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:17:22,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:17:22,122 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:28,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:17:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:47,089 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2022-02-20 17:17:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:17:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 15 [2022-02-20 17:17:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-02-20 17:17:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-02-20 17:17:47,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 139 transitions. [2022-02-20 17:17:47,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:47,211 INFO L225 Difference]: With dead ends: 98 [2022-02-20 17:17:47,211 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 17:17:47,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 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:17:47,213 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:47,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-02-20 17:17:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 17:17:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2022-02-20 17:17:47,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:47,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:47,251 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:47,251 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:47,257 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2022-02-20 17:17:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-02-20 17:17:47,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:47,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:47,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-02-20 17:17:47,260 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-02-20 17:17:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:47,268 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2022-02-20 17:17:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-02-20 17:17:47,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:47,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:47,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:47,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-02-20 17:17:47,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 15 [2022-02-20 17:17:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:47,274 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-02-20 17:17:47,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:17:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-02-20 17:17:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:17:47,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:47,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:47,293 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:17:47,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:47,483 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2016757679, now seen corresponding path program 1 times [2022-02-20 17:17:47,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:47,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246173321] [2022-02-20 17:17:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:47,507 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:47,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076742990] [2022-02-20 17:17:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:47,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:47,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:47,519 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:17:47,520 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:17:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:47,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:17:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:47,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:47,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {1330#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:47,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:47,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1335#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:47,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {1335#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:47,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {1335#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1348#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:47,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {1348#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1348#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:47,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(<= ~counter~0 1)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1348#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:47,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1358#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {1358#(<= ~counter~0 2)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1368#(<= |ULTIMATE.start_main_#t~post6#1| 2)} is VALID [2022-02-20 17:17:47,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {1368#(<= |ULTIMATE.start_main_#t~post6#1| 2)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1331#false} is VALID [2022-02-20 17:17:47,642 INFO L272 TraceCheckUtils]: 12: Hoare triple {1331#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {1331#false} is VALID [2022-02-20 17:17:47,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#false} ~cond := #in~cond; {1331#false} is VALID [2022-02-20 17:17:47,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1331#false} assume 0 == ~cond; {1331#false} is VALID [2022-02-20 17:17:47,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1331#false} assume !false; {1331#false} is VALID [2022-02-20 17:17:47,643 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:17:47,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:17:47,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {1331#false} assume !false; {1331#false} is VALID [2022-02-20 17:17:47,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1331#false} assume 0 == ~cond; {1331#false} is VALID [2022-02-20 17:17:47,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#false} ~cond := #in~cond; {1331#false} is VALID [2022-02-20 17:17:47,746 INFO L272 TraceCheckUtils]: 12: Hoare triple {1331#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {1331#false} is VALID [2022-02-20 17:17:47,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#(< |ULTIMATE.start_main_#t~post6#1| 5)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1331#false} is VALID [2022-02-20 17:17:47,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(< ~counter~0 5)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1396#(< |ULTIMATE.start_main_#t~post6#1| 5)} is VALID [2022-02-20 17:17:47,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {1400#(< ~counter~0 5)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1400#(< ~counter~0 5)} is VALID [2022-02-20 17:17:47,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(< ~counter~0 5)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1400#(< ~counter~0 5)} is VALID [2022-02-20 17:17:47,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(< ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1400#(< ~counter~0 5)} is VALID [2022-02-20 17:17:47,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(< ~counter~0 4)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1410#(< ~counter~0 4)} is VALID [2022-02-20 17:17:47,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#(< ~counter~0 4)} assume !!(main_#t~post5#1 < 5);havoc main_#t~post5#1; {1410#(< ~counter~0 4)} is VALID [2022-02-20 17:17:47,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {1358#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1410#(< ~counter~0 4)} is VALID [2022-02-20 17:17:47,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {1358#(<= ~counter~0 2)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1358#(<= ~counter~0 2)} assume !(0 == assume_abort_if_not_~cond#1); {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1358#(<= ~counter~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {1330#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:47,757 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:17:47,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:47,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246173321] [2022-02-20 17:17:47,757 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:47,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076742990] [2022-02-20 17:17:47,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076742990] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:17:47,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:17:47,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 17:17:47,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720147832] [2022-02-20 17:17:47,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:17:47,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 16 [2022-02-20 17:17:47,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:47,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:47,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:47,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:17:47,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:47,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:17:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:17:47,776 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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:52,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:17:54,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:17:57,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []