./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d205b4d392fcf6603d2c7a58c20f30b20ad63dac227f46def37edd46d8cc7990 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:16:28,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:28,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:28,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:28,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:28,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:28,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:28,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:28,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:28,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:28,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:28,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:28,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:28,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:28,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:28,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:28,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:28,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:28,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:28,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:28,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:28,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:28,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:28,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:28,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:28,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:28,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:28,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:28,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:28,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:28,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:28,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:28,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:28,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:28,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:28,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:28,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:28,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:28,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:28,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:28,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:28,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:28,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:28,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:28,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:28,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:28,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:28,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:28,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:28,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:28,180 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:28,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:28,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:28,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:28,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:28,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:28,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:28,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:28,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:28,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:28,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:28,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:28,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:28,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:28,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:28,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:28,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:28,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:28,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:28,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:28,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:28,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:28,185 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:28,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:28,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:28,185 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 -> d205b4d392fcf6603d2c7a58c20f30b20ad63dac227f46def37edd46d8cc7990 [2022-02-20 17:16:28,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:28,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:28,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:28,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:28,415 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:28,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-02-20 17:16:28,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c0793eb/4f5aa73dd6844fa68f5ea47fe5f85bc3/FLAG025e3152e [2022-02-20 17:16:28,898 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:28,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-02-20 17:16:28,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c0793eb/4f5aa73dd6844fa68f5ea47fe5f85bc3/FLAG025e3152e [2022-02-20 17:16:29,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c0793eb/4f5aa73dd6844fa68f5ea47fe5f85bc3 [2022-02-20 17:16:29,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:29,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:29,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:29,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:29,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:29,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b24a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29, skipping insertion in model container [2022-02-20 17:16:29,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:29,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:29,510 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_unwindbound1.c[525,538] [2022-02-20 17:16:29,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:29,576 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:29,590 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_unwindbound1.c[525,538] [2022-02-20 17:16:29,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:29,634 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:29,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29 WrapperNode [2022-02-20 17:16:29,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:29,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:29,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:29,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:29,642 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:29" (1/1) ... [2022-02-20 17:16:29,658 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:29" (1/1) ... [2022-02-20 17:16:29,691 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-02-20 17:16:29,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:29,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:29,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:29,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:29,702 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:29" (1/1) ... [2022-02-20 17:16:29,702 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:29" (1/1) ... [2022-02-20 17:16:29,704 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:29" (1/1) ... [2022-02-20 17:16:29,705 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:29" (1/1) ... [2022-02-20 17:16:29,717 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:29" (1/1) ... [2022-02-20 17:16:29,721 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:29" (1/1) ... [2022-02-20 17:16:29,727 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:29" (1/1) ... [2022-02-20 17:16:29,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:29,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:29,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:29,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:29,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:29,760 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:29,786 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:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:29,856 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:29,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:30,059 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:30,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:30,081 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:30,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:30 BoogieIcfgContainer [2022-02-20 17:16:30,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:30,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:30,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:30,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:30,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:29" (1/3) ... [2022-02-20 17:16:30,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:30, skipping insertion in model container [2022-02-20 17:16:30,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (2/3) ... [2022-02-20 17:16:30,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:30, skipping insertion in model container [2022-02-20 17:16:30,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:30" (3/3) ... [2022-02-20 17:16:30,090 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound1.c [2022-02-20 17:16:30,110 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:30,110 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:30,169 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:30,178 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:30,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:30,200 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:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:16:30,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:30,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:30,205 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2022-02-20 17:16:30,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:30,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789657666] [2022-02-20 17:16:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:30,391 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:30,391 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:30,393 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:30,394 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:30,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:30,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:30,395 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:30,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-02-20 17:16:30,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-02-20 17:16:30,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 17:16:30,397 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:30,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:30,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789657666] [2022-02-20 17:16:30,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789657666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:30,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:30,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:30,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591087961] [2022-02-20 17:16:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:30,407 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:30,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:30,410 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:30,434 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:30,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:30,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:30,462 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:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,726 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2022-02-20 17:16:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:32,726 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:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:32,727 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:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:32,738 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:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:32,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-20 17:16:32,871 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:32,879 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:16:32,880 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:16:32,882 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:32,885 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:32,886 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:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:16:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:16:32,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:32,912 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:32,912 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:32,913 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:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,918 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:32,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:32,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:32,919 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:32,920 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:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,923 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:32,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:32,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:32,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:32,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:32,925 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:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-02-20 17:16:32,929 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2022-02-20 17:16:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:32,929 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2022-02-20 17:16:32,930 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:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:16:32,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:32,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:32,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:32,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2022-02-20 17:16:32,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:32,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380152644] [2022-02-20 17:16:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:33,005 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:33,005 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:33,006 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:33,006 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:33,007 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:33,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 1);havoc main_#t~post5#1; {208#false} is VALID [2022-02-20 17:16:33,008 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:33,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#false} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:33,009 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:33,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 17:16:33,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2022-02-20 17:16:33,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 17:16:33,010 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:33,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:33,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380152644] [2022-02-20 17:16:33,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380152644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:33,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:33,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:16:33,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900563661] [2022-02-20 17:16:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:33,013 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:33,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:33,013 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:33,025 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:33,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:16:33,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:16:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:16:33,026 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:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:37,105 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-02-20 17:16:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:16:37,105 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:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:37,106 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:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:37,109 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:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:37,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-02-20 17:16:37,221 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:37,224 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:16:37,224 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:16:37,228 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:37,231 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:37,232 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:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:16:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:16:37,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:37,241 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:37,242 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:37,243 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:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:37,247 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:37,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:37,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:37,254 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:37,256 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:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:37,260 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:37,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:37,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:37,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:37,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:37,264 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:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-02-20 17:16:37,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2022-02-20 17:16:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:37,268 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-02-20 17:16:37,269 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:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:37,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:37,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:37,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:16:37,271 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2022-02-20 17:16:37,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:37,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677470105] [2022-02-20 17:16:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:37,296 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:37,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026644917] [2022-02-20 17:16:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:37,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:37,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:37,299 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:37,323 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:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:37,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:16:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:37,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:37,528 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; {378#true} is VALID [2022-02-20 17:16:37,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#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; {378#true} is VALID [2022-02-20 17:16:37,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume !(0 == assume_abort_if_not_~cond#1); {378#true} is VALID [2022-02-20 17:16:37,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {378#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; {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:16:37,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:16:37,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:16:37,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:16:37,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:16:37,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:16:37,536 INFO L272 TraceCheckUtils]: 9: Hoare triple {392#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} 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)); {411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:37,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:37,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {379#false} is VALID [2022-02-20 17:16:37,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-02-20 17:16:37,538 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:37,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:37,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:37,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677470105] [2022-02-20 17:16:37,539 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:37,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026644917] [2022-02-20 17:16:37,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026644917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:37,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:37,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:16:37,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910561202] [2022-02-20 17:16:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:37,544 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:37,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:37,544 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:37,559 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:37,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:37,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:37,566 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:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:42,031 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2022-02-20 17:16:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:42,031 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:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:42,032 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:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:16:42,034 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:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:16:42,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 17:16:42,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:42,134 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:16:42,134 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 17:16:42,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:16:42,135 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:42,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 137 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:16:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 17:16:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 17:16:42,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:42,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:42,147 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:42,147 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:42,151 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-02-20 17:16:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2022-02-20 17:16:42,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:42,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:42,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-02-20 17:16:42,156 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-02-20 17:16:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:42,169 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-02-20 17:16:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2022-02-20 17:16:42,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:42,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:42,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:42,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2022-02-20 17:16:42,177 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 13 [2022-02-20 17:16:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:42,177 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2022-02-20 17:16:42,177 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:16:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2022-02-20 17:16:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:42,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:42,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:42,186 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:16:42,383 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:16:42,383 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2022-02-20 17:16:42,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:42,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599932494] [2022-02-20 17:16:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:42,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#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; {643#(= ~counter~0 0)} is VALID [2022-02-20 17:16:42,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#(= ~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; {643#(= ~counter~0 0)} is VALID [2022-02-20 17:16:42,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {643#(= ~counter~0 0)} is VALID [2022-02-20 17:16:42,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {643#(= ~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; {643#(= ~counter~0 0)} is VALID [2022-02-20 17:16:42,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {643#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {644#(and (= |ULTIMATE.start_main_#t~post5#1| 0) (<= (+ |ULTIMATE.start_main_#t~post5#1| 1) ~counter~0))} is VALID [2022-02-20 17:16:42,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#(and (= |ULTIMATE.start_main_#t~post5#1| 0) (<= (+ |ULTIMATE.start_main_#t~post5#1| 1) ~counter~0))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {645#(<= 1 ~counter~0)} is VALID [2022-02-20 17:16:42,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {645#(<= 1 ~counter~0)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {645#(<= 1 ~counter~0)} is VALID [2022-02-20 17:16:42,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {645#(<= 1 ~counter~0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {646#(<= 1 |ULTIMATE.start_main_#t~post6#1|)} is VALID [2022-02-20 17:16:42,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {646#(<= 1 |ULTIMATE.start_main_#t~post6#1|)} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {642#false} is VALID [2022-02-20 17:16:42,482 INFO L272 TraceCheckUtils]: 9: Hoare triple {642#false} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {642#false} is VALID [2022-02-20 17:16:42,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#false} ~cond := #in~cond; {642#false} is VALID [2022-02-20 17:16:42,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {642#false} assume 0 == ~cond; {642#false} is VALID [2022-02-20 17:16:42,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-02-20 17:16:42,483 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:42,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:42,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599932494] [2022-02-20 17:16:42,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599932494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:42,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:42,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:16:42,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010989722] [2022-02-20 17:16:42,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:42,488 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:16:42,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:42,489 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:16:42,506 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:42,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:16:42,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:16:42,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:16:42,508 INFO L87 Difference]: Start difference. First operand 43 states and 63 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:16:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:43,044 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-02-20 17:16:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:16:43,044 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:16:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:43,044 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:16:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 17:16:43,046 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:16:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 17:16:43,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 17:16:43,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:43,098 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:16:43,098 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:16:43,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:16:43,100 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:43,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:16:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:16:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:16:43,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:43,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,107 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,107 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:43,108 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 17:16:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 17:16:43,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:43,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:43,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-02-20 17:16:43,109 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-02-20 17:16:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:43,109 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 17:16:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 17:16:43,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:43,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:43,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:43,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 17:16:43,111 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 13 [2022-02-20 17:16:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:43,111 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 17:16:43,112 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:16:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 17:16:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:16:43,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:43,112 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:43,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:16:43,113 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1294398873, now seen corresponding path program 1 times [2022-02-20 17:16:43,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:43,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747912497] [2022-02-20 17:16:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:43,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:43,126 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:43,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115022794] [2022-02-20 17:16:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:43,128 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:16:43,136 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:16:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:43,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:16:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:43,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:43,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#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; {800#true} is VALID [2022-02-20 17:16:43,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#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; {800#true} is VALID [2022-02-20 17:16:43,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#true} assume !(0 == assume_abort_if_not_~cond#1); {800#true} is VALID [2022-02-20 17:16:43,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#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; {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,281 INFO L272 TraceCheckUtils]: 9: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} 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)); {800#true} is VALID [2022-02-20 17:16:43,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#true} ~cond := #in~cond; {800#true} is VALID [2022-02-20 17:16:43,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {800#true} assume !(0 == ~cond); {800#true} is VALID [2022-02-20 17:16:43,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {800#true} assume true; {800#true} is VALID [2022-02-20 17:16:43,282 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {800#true} {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} #88#return; {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:16:43,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {814#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == (main_~p~0#1 * main_~p~0#1 - main_~n~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:43,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:43,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {801#false} is VALID [2022-02-20 17:16:43,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {801#false} assume !false; {801#false} is VALID [2022-02-20 17:16:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:43,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:43,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:43,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747912497] [2022-02-20 17:16:43,285 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:43,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115022794] [2022-02-20 17:16:43,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115022794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:43,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:43,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:16:43,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859146137] [2022-02-20 17:16:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 17:16:43,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:43,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:43,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:43,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:43,303 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:43,358 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 17:16:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 17:16:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-20 17:16:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-20 17:16:43,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-02-20 17:16:43,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:43,376 INFO L225 Difference]: With dead ends: 21 [2022-02-20 17:16:43,376 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:16:43,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:16:43,378 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:43,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:16:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:16:43,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:43,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:43,379 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:43,380 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:43,380 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:16:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:43,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:43,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:43,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:16:43,381 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:16:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:43,381 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:16:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:43,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:43,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:43,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:43,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:16:43,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 17:16:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:43,383 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:16:43,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:16:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:43,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:43,385 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:16:43,402 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:16:43,586 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:16:43,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:16:43,659 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-02-20 17:16:43,659 INFO L861 garLoopResultBuilder]: At program point L60(lines 20 61) the Hoare annotation is: true [2022-02-20 17:16:43,659 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-02-20 17:16:43,659 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2022-02-20 17:16:43,659 INFO L858 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2022-02-20 17:16:43,659 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: false [2022-02-20 17:16:43,659 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:16:43,660 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:16:43,660 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:16:43,660 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (<= 1 ~counter~0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:16:43,660 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2022-02-20 17:16:43,660 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-02-20 17:16:43,660 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:16:43,661 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0)) [2022-02-20 17:16:43,661 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: false [2022-02-20 17:16:43,661 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-02-20 17:16:43,661 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2022-02-20 17:16:43,661 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (<= 1 ~counter~0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) [2022-02-20 17:16:43,661 INFO L858 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-02-20 17:16:43,662 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 (= ~counter~0 0) .cse2) (and .cse0 .cse1 (<= 1 ~counter~0) .cse2))) [2022-02-20 17:16:43,662 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-02-20 17:16:43,662 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: false [2022-02-20 17:16:43,662 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: false [2022-02-20 17:16:43,662 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: false [2022-02-20 17:16:43,662 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-02-20 17:16:43,663 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-02-20 17:16:43,663 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-02-20 17:16:43,663 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:16:43,663 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-02-20 17:16:43,663 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 17:16:43,666 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:16:43,667 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:16:43,670 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:16:43,670 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:43,670 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:16:43,670 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:43,670 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:43,670 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,671 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:16:43,672 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:16:43,673 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:16:43,674 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:16:43,675 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:16:43,675 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:16:43,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:16:43 BoogieIcfgContainer [2022-02-20 17:16:43,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:16:43,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:16:43,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:16:43,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:16:43,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:30" (3/4) ... [2022-02-20 17:16:43,686 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:16:43,690 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:16:43,693 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:16:43,693 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:16:43,693 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:16:43,694 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:16:43,722 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:16:43,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:16:43,723 INFO L158 Benchmark]: Toolchain (without parser) took 14416.65ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 74.6MB in the beginning and 55.9MB in the end (delta: 18.7MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-02-20 17:16:43,724 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 63.8MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:16:43,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.14ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 76.8MB in the end (delta: -2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:16:43,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:16:43,725 INFO L158 Benchmark]: Boogie Preprocessor took 34.05ms. Allocated memory is still 104.9MB. Free memory was 74.7MB in the beginning and 73.7MB in the end (delta: 972.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:16:43,725 INFO L158 Benchmark]: RCFGBuilder took 353.03ms. Allocated memory is still 104.9MB. Free memory was 73.4MB in the beginning and 61.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:16:43,725 INFO L158 Benchmark]: TraceAbstraction took 13598.69ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 60.4MB in the beginning and 59.0MB in the end (delta: 1.4MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-02-20 17:16:43,726 INFO L158 Benchmark]: Witness Printer took 39.36ms. Allocated memory is still 132.1MB. Free memory was 59.0MB in the beginning and 55.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:16:43,727 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 63.8MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.14ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 76.8MB in the end (delta: -2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.05ms. Allocated memory is still 104.9MB. Free memory was 74.7MB in the beginning and 73.7MB in the end (delta: 972.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.03ms. Allocated memory is still 104.9MB. Free memory was 73.4MB in the beginning and 61.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13598.69ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 60.4MB in the beginning and 59.0MB in the end (delta: 1.4MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 39.36ms. Allocated memory is still 132.1MB. Free memory was 59.0MB in the beginning and 55.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 148 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 49 PreInvPairs, 55 NumberOfFragments, 68 HoareAnnotationTreeSize, 49 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 179 SizeOfPredicates, 2 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((p == 0 && h == 0) && counter == 0) && n == r) || (((p == 0 && h == 0) && 1 <= counter) && n == r) RESULT: Ultimate proved your program to be correct! [2022-02-20 17:16:43,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE