./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sumt3.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/loops-crafted-1/sumt3.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 9a991522a2979b9189ac7eadf39d5617fdf4ddda ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:13:58,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:13:58,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:13:58,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:13:58,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:13:58,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:13:58,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:13:58,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:13:58,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:13:58,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:13:58,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:13:58,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:13:58,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:13:58,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:13:58,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:13:58,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:13:58,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:13:58,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:13:58,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:13:58,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:13:58,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:13:58,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:13:58,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:13:58,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:13:58,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:13:58,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:13:58,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:13:58,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:13:58,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:13:58,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:13:58,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:13:58,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:13:58,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:13:58,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:13:58,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:13:58,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:13:58,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:13:58,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:13:58,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:13:58,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:13:58,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:13:58,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:13:58,399 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:13:58,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:13:58,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:13:58,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:13:58,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:13:58,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:13:58,402 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:13:58,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:13:58,403 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:13:58,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:13:58,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:13:58,404 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:13:58,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:13:58,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:13:58,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:13:58,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:13:58,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:13:58,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:13:58,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:13:58,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:13:58,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:13:58,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:13:58,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:13:58,406 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:13:58,406 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 -> 9a991522a2979b9189ac7eadf39d5617fdf4ddda [2021-09-13 14:13:58,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:13:58,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:13:58,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:13:58,681 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:13:58,682 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:13:58,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt3.c [2021-09-13 14:13:58,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a25275cf/2dccfac1136f4f9687fe6877bea371fc/FLAG2325169c3 [2021-09-13 14:13:59,095 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:13:59,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt3.c [2021-09-13 14:13:59,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a25275cf/2dccfac1136f4f9687fe6877bea371fc/FLAG2325169c3 [2021-09-13 14:13:59,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a25275cf/2dccfac1136f4f9687fe6877bea371fc [2021-09-13 14:13:59,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:13:59,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:13:59,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:13:59,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:13:59,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:13:59,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36462001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59, skipping insertion in model container [2021-09-13 14:13:59,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:13:59,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:13:59,223 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt3.c[403,416] [2021-09-13 14:13:59,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:13:59,248 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:13:59,255 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt3.c[403,416] [2021-09-13 14:13:59,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:13:59,271 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:13:59,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59 WrapperNode [2021-09-13 14:13:59,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:13:59,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:13:59,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:13:59,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:13:59,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:13:59,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:13:59,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:13:59,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:13:59,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:13:59,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:13:59,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:13:59,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:13:59,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (1/1) ... [2021-09-13 14:13:59,340 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:13:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:13:59,357 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) [2021-09-13 14:13:59,362 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 [2021-09-13 14:13:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:13:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:13:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:13:59,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:13:59,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:13:59,553 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:13:59,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:13:59 BoogieIcfgContainer [2021-09-13 14:13:59,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:13:59,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:13:59,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:13:59,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:13:59,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:13:59" (1/3) ... [2021-09-13 14:13:59,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cc5022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:13:59, skipping insertion in model container [2021-09-13 14:13:59,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:13:59" (2/3) ... [2021-09-13 14:13:59,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cc5022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:13:59, skipping insertion in model container [2021-09-13 14:13:59,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:13:59" (3/3) ... [2021-09-13 14:13:59,560 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.c [2021-09-13 14:13:59,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:13:59,574 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:13:59,631 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:13:59,636 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-13 14:13:59,648 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:13:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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) [2021-09-13 14:13:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:13:59,680 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:13:59,681 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:13:59,682 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:13:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:13:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1807458888, now seen corresponding path program 1 times [2021-09-13 14:13:59,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:13:59,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899189306] [2021-09-13 14:13:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:13:59,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:13:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:13:59,849 INFO L281 TraceCheckUtils]: 0: Hoare triple {18#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {18#true} is VALID [2021-09-13 14:13:59,850 INFO L281 TraceCheckUtils]: 1: Hoare triple {18#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {18#true} is VALID [2021-09-13 14:13:59,850 INFO L281 TraceCheckUtils]: 2: Hoare triple {18#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {18#true} is VALID [2021-09-13 14:13:59,851 INFO L281 TraceCheckUtils]: 3: Hoare triple {18#true} assume !true; {19#false} is VALID [2021-09-13 14:13:59,851 INFO L281 TraceCheckUtils]: 4: Hoare triple {19#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {19#false} is VALID [2021-09-13 14:13:59,851 INFO L281 TraceCheckUtils]: 5: Hoare triple {19#false} assume 0 == __VERIFIER_assert_~cond; {19#false} is VALID [2021-09-13 14:13:59,851 INFO L281 TraceCheckUtils]: 6: Hoare triple {19#false} assume !false; {19#false} is VALID [2021-09-13 14:13:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:13:59,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:13:59,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899189306] [2021-09-13 14:13:59,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899189306] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:13:59,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:13:59,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:13:59,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676561996] [2021-09-13 14:13:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:13:59,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:13:59,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:13:59,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:13:59,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:13:59,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:13:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:13:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:13:59,899 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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 has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:14:01,941 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:02,149 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-09-13 14:14:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:14:02,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:14:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:14:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2021-09-13 14:14:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:14:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2021-09-13 14:14:02,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 28 transitions. [2021-09-13 14:14:02,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:02,189 INFO L225 Difference]: With dead ends: 23 [2021-09-13 14:14:02,189 INFO L226 Difference]: Without dead ends: 11 [2021-09-13 14:14:02,191 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:02,193 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2038.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2215.06ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:02,193 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 18 Unknown, 0 Unchecked, 0.34ms Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2215.06ms Time] [2021-09-13 14:14:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-09-13 14:14:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-09-13 14:14:02,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:02,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2021-09-13 14:14:02,212 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2021-09-13 14:14:02,212 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2021-09-13 14:14:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:02,213 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2021-09-13 14:14:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2021-09-13 14:14:02,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:02,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:02,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 11 states. [2021-09-13 14:14:02,214 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 11 states. [2021-09-13 14:14:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:02,215 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2021-09-13 14:14:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2021-09-13 14:14:02,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:02,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:02,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:02,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2021-09-13 14:14:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2021-09-13 14:14:02,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2021-09-13 14:14:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:02,219 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-09-13 14:14:02,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:14:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2021-09-13 14:14:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:02,219 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:02,220 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:02,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:14:02,220 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1806982232, now seen corresponding path program 1 times [2021-09-13 14:14:02,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:02,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585383501] [2021-09-13 14:14:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:02,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:02,431 INFO L281 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {84#true} is VALID [2021-09-13 14:14:02,431 INFO L281 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {84#true} is VALID [2021-09-13 14:14:02,432 INFO L281 TraceCheckUtils]: 2: Hoare triple {84#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {86#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:02,433 INFO L281 TraceCheckUtils]: 3: Hoare triple {86#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {86#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:02,433 INFO L281 TraceCheckUtils]: 4: Hoare triple {86#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {87#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:02,434 INFO L281 TraceCheckUtils]: 5: Hoare triple {87#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {85#false} is VALID [2021-09-13 14:14:02,434 INFO L281 TraceCheckUtils]: 6: Hoare triple {85#false} assume !false; {85#false} is VALID [2021-09-13 14:14:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:02,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:02,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585383501] [2021-09-13 14:14:02,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585383501] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:02,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:02,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:14:02,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692960829] [2021-09-13 14:14:02,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:14:02,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:02,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:14:02,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:02,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:14:02,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:02,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:14:02,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:14:02,444 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:14:04,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:04,717 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2021-09-13 14:14:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:14:04,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:14:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:14:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-09-13 14:14:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:14:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-09-13 14:14:04,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2021-09-13 14:14:04,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:04,737 INFO L225 Difference]: With dead ends: 17 [2021-09-13 14:14:04,737 INFO L226 Difference]: Without dead ends: 13 [2021-09-13 14:14:04,738 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.24ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:04,739 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2043.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.67ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2215.26ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:04,739 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.67ms Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 2215.26ms Time] [2021-09-13 14:14:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-09-13 14:14:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-09-13 14:14:04,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:04,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2021-09-13 14:14:04,744 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2021-09-13 14:14:04,744 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2021-09-13 14:14:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:04,745 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-09-13 14:14:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2021-09-13 14:14:04,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:04,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:04,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 13 states. [2021-09-13 14:14:04,746 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 13 states. [2021-09-13 14:14:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:04,747 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-09-13 14:14:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2021-09-13 14:14:04,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:04,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:04,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:04,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2021-09-13 14:14:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-09-13 14:14:04,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2021-09-13 14:14:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:04,749 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-09-13 14:14:04,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:14:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-09-13 14:14:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:14:04,750 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:04,750 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:04,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:14:04,750 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash 83295881, now seen corresponding path program 1 times [2021-09-13 14:14:04,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:04,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627937542] [2021-09-13 14:14:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:04,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:05,159 INFO L281 TraceCheckUtils]: 0: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {151#true} is VALID [2021-09-13 14:14:05,159 INFO L281 TraceCheckUtils]: 1: Hoare triple {151#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {151#true} is VALID [2021-09-13 14:14:05,160 INFO L281 TraceCheckUtils]: 2: Hoare triple {151#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {153#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,161 INFO L281 TraceCheckUtils]: 3: Hoare triple {153#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {154#(and (= ULTIMATE.start_main_~k~0 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,161 INFO L281 TraceCheckUtils]: 4: Hoare triple {154#(and (= ULTIMATE.start_main_~k~0 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {155#(and (<= ULTIMATE.start_main_~i~0 1) (<= (+ 2 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,163 INFO L281 TraceCheckUtils]: 5: Hoare triple {155#(and (<= ULTIMATE.start_main_~i~0 1) (<= (+ 2 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {156#(and (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (or (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296)))) (and (<= (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0)) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (div ULTIMATE.start_main_~l~0 4294967296)))) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,164 INFO L281 TraceCheckUtils]: 6: Hoare triple {156#(and (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (or (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296)))) (and (<= (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0)) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (div ULTIMATE.start_main_~l~0 4294967296)))) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {157#(and (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296)))) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,166 INFO L281 TraceCheckUtils]: 7: Hoare triple {157#(and (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296)))) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {158#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:05,166 INFO L281 TraceCheckUtils]: 8: Hoare triple {158#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {152#false} is VALID [2021-09-13 14:14:05,166 INFO L281 TraceCheckUtils]: 9: Hoare triple {152#false} assume !false; {152#false} is VALID [2021-09-13 14:14:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:05,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:05,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627937542] [2021-09-13 14:14:05,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627937542] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:05,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163120380] [2021-09-13 14:14:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:05,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:05,174 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) [2021-09-13 14:14:05,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:14:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:05,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:14:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:05,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:05,465 INFO L281 TraceCheckUtils]: 0: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {151#true} is VALID [2021-09-13 14:14:05,466 INFO L281 TraceCheckUtils]: 1: Hoare triple {151#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {151#true} is VALID [2021-09-13 14:14:05,471 INFO L281 TraceCheckUtils]: 2: Hoare triple {151#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {153#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,472 INFO L281 TraceCheckUtils]: 3: Hoare triple {153#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {153#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,472 INFO L281 TraceCheckUtils]: 4: Hoare triple {153#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {174#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,473 INFO L281 TraceCheckUtils]: 5: Hoare triple {174#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {178#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,473 INFO L281 TraceCheckUtils]: 6: Hoare triple {178#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {178#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:05,474 INFO L281 TraceCheckUtils]: 7: Hoare triple {178#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {185#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:05,474 INFO L281 TraceCheckUtils]: 8: Hoare triple {185#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {152#false} is VALID [2021-09-13 14:14:05,474 INFO L281 TraceCheckUtils]: 9: Hoare triple {152#false} assume !false; {152#false} is VALID [2021-09-13 14:14:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:05,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:05,648 INFO L281 TraceCheckUtils]: 9: Hoare triple {152#false} assume !false; {152#false} is VALID [2021-09-13 14:14:05,648 INFO L281 TraceCheckUtils]: 8: Hoare triple {185#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {152#false} is VALID [2021-09-13 14:14:05,649 INFO L281 TraceCheckUtils]: 7: Hoare triple {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {185#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:05,649 INFO L281 TraceCheckUtils]: 6: Hoare triple {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:05,650 INFO L281 TraceCheckUtils]: 5: Hoare triple {205#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))} main_~l~0 := 1 + main_~l~0; {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:07,766 INFO L281 TraceCheckUtils]: 4: Hoare triple {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {205#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))} is UNKNOWN [2021-09-13 14:14:07,771 INFO L281 TraceCheckUtils]: 3: Hoare triple {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:07,772 INFO L281 TraceCheckUtils]: 2: Hoare triple {151#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {198#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:07,772 INFO L281 TraceCheckUtils]: 1: Hoare triple {151#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {151#true} is VALID [2021-09-13 14:14:07,772 INFO L281 TraceCheckUtils]: 0: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {151#true} is VALID [2021-09-13 14:14:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:14:07,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163120380] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:07,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:07,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 6] total 13 [2021-09-13 14:14:07,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343915664] [2021-09-13 14:14:07,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2021-09-13 14:14:07,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:07,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-09-13 14:14:09,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 9 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:09,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:09,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:09,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:09,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:14:09,896 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-09-13 14:14:11,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:12,215 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2021-09-13 14:14:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2021-09-13 14:14:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-09-13 14:14:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-09-13 14:14:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-09-13 14:14:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-09-13 14:14:12,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2021-09-13 14:14:14,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:14,351 INFO L225 Difference]: With dead ends: 19 [2021-09-13 14:14:14,351 INFO L226 Difference]: Without dead ends: 15 [2021-09-13 14:14:14,351 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 252.87ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:14:14,352 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2064.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2232.02ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:14,352 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.59ms Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2232.02ms Time] [2021-09-13 14:14:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-09-13 14:14:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-09-13 14:14:14,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:14,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-09-13 14:14:14,358 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-09-13 14:14:14,358 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-09-13 14:14:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:14,359 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2021-09-13 14:14:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-09-13 14:14:14,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:14,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:14,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 15 states. [2021-09-13 14:14:14,359 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 15 states. [2021-09-13 14:14:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:14,362 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2021-09-13 14:14:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2021-09-13 14:14:14,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:14,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:14,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:14,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-09-13 14:14:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-09-13 14:14:14,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2021-09-13 14:14:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:14,364 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-09-13 14:14:14,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2021-09-13 14:14:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2021-09-13 14:14:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:14:14,365 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:14,365 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:14,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-09-13 14:14:14,565 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 [2021-09-13 14:14:14,566 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash -39914079, now seen corresponding path program 1 times [2021-09-13 14:14:14,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:14,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750093403] [2021-09-13 14:14:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:14,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:14,672 INFO L281 TraceCheckUtils]: 0: Hoare triple {290#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {290#true} is VALID [2021-09-13 14:14:14,673 INFO L281 TraceCheckUtils]: 1: Hoare triple {290#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {290#true} is VALID [2021-09-13 14:14:14,673 INFO L281 TraceCheckUtils]: 2: Hoare triple {290#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {292#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:14,673 INFO L281 TraceCheckUtils]: 3: Hoare triple {292#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {292#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:14,674 INFO L281 TraceCheckUtils]: 4: Hoare triple {292#(= ULTIMATE.start_main_~l~0 0)} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {291#false} is VALID [2021-09-13 14:14:14,674 INFO L281 TraceCheckUtils]: 5: Hoare triple {291#false} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {291#false} is VALID [2021-09-13 14:14:14,674 INFO L281 TraceCheckUtils]: 6: Hoare triple {291#false} main_~l~0 := 1 + main_~l~0; {291#false} is VALID [2021-09-13 14:14:14,674 INFO L281 TraceCheckUtils]: 7: Hoare triple {291#false} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {291#false} is VALID [2021-09-13 14:14:14,674 INFO L281 TraceCheckUtils]: 8: Hoare triple {291#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {291#false} is VALID [2021-09-13 14:14:14,675 INFO L281 TraceCheckUtils]: 9: Hoare triple {291#false} assume 0 == __VERIFIER_assert_~cond; {291#false} is VALID [2021-09-13 14:14:14,675 INFO L281 TraceCheckUtils]: 10: Hoare triple {291#false} assume !false; {291#false} is VALID [2021-09-13 14:14:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:14,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:14,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750093403] [2021-09-13 14:14:14,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750093403] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:14,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:14,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:14:14,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027169432] [2021-09-13 14:14:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2021-09-13 14:14:14,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:14,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-09-13 14:14:16,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:16,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-13 14:14:16,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-13 14:14:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:14:16,870 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-09-13 14:14:18,901 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:19,095 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2021-09-13 14:14:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-13 14:14:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2021-09-13 14:14:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-09-13 14:14:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2021-09-13 14:14:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-09-13 14:14:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2021-09-13 14:14:19,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2021-09-13 14:14:21,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:21,302 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:14:21,302 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:14:21,302 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.26ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:14:21,303 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2024.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.29ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2194.62ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:21,303 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.29ms Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2194.62ms Time] [2021-09-13 14:14:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:14:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-09-13 14:14:21,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:21,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2021-09-13 14:14:21,309 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2021-09-13 14:14:21,309 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2021-09-13 14:14:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:21,310 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2021-09-13 14:14:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-09-13 14:14:21,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:21,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:21,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 17 states. [2021-09-13 14:14:21,311 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 17 states. [2021-09-13 14:14:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:21,311 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2021-09-13 14:14:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-09-13 14:14:21,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:21,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:21,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:21,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2021-09-13 14:14:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-09-13 14:14:21,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2021-09-13 14:14:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:21,312 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-09-13 14:14:21,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2021-09-13 14:14:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2021-09-13 14:14:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:14:21,313 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:21,313 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:21,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-13 14:14:21,313 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash 326309714, now seen corresponding path program 1 times [2021-09-13 14:14:21,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:21,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847930595] [2021-09-13 14:14:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:21,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:21,386 INFO L281 TraceCheckUtils]: 0: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {377#true} is VALID [2021-09-13 14:14:21,386 INFO L281 TraceCheckUtils]: 1: Hoare triple {377#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {377#true} is VALID [2021-09-13 14:14:21,387 INFO L281 TraceCheckUtils]: 2: Hoare triple {377#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {379#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:21,387 INFO L281 TraceCheckUtils]: 3: Hoare triple {379#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {379#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:21,388 INFO L281 TraceCheckUtils]: 4: Hoare triple {379#(= ULTIMATE.start_main_~l~0 0)} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {379#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:21,388 INFO L281 TraceCheckUtils]: 5: Hoare triple {379#(= ULTIMATE.start_main_~l~0 0)} main_~l~0 := 1 + main_~l~0; {380#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:21,388 INFO L281 TraceCheckUtils]: 6: Hoare triple {380#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {380#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:21,389 INFO L281 TraceCheckUtils]: 7: Hoare triple {380#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {380#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:21,390 INFO L281 TraceCheckUtils]: 8: Hoare triple {380#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {378#false} is VALID [2021-09-13 14:14:21,390 INFO L281 TraceCheckUtils]: 9: Hoare triple {378#false} main_~l~0 := 1 + main_~l~0; {378#false} is VALID [2021-09-13 14:14:21,390 INFO L281 TraceCheckUtils]: 10: Hoare triple {378#false} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {378#false} is VALID [2021-09-13 14:14:21,391 INFO L281 TraceCheckUtils]: 11: Hoare triple {378#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {378#false} is VALID [2021-09-13 14:14:21,391 INFO L281 TraceCheckUtils]: 12: Hoare triple {378#false} assume 0 == __VERIFIER_assert_~cond; {378#false} is VALID [2021-09-13 14:14:21,391 INFO L281 TraceCheckUtils]: 13: Hoare triple {378#false} assume !false; {378#false} is VALID [2021-09-13 14:14:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:21,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:21,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847930595] [2021-09-13 14:14:21,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847930595] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:21,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032668391] [2021-09-13 14:14:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:21,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:21,393 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) [2021-09-13 14:14:21,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:14:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:21,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:14:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:21,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:21,735 INFO L281 TraceCheckUtils]: 0: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {377#true} is VALID [2021-09-13 14:14:21,736 INFO L281 TraceCheckUtils]: 1: Hoare triple {377#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {377#true} is VALID [2021-09-13 14:14:21,736 INFO L281 TraceCheckUtils]: 2: Hoare triple {377#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {390#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:21,737 INFO L281 TraceCheckUtils]: 3: Hoare triple {390#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {390#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:21,737 INFO L281 TraceCheckUtils]: 4: Hoare triple {390#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {397#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:21,738 INFO L281 TraceCheckUtils]: 5: Hoare triple {397#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {401#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:21,738 INFO L281 TraceCheckUtils]: 6: Hoare triple {401#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {401#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:21,739 INFO L281 TraceCheckUtils]: 7: Hoare triple {401#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {401#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:21,739 INFO L281 TraceCheckUtils]: 8: Hoare triple {401#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {411#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:21,740 INFO L281 TraceCheckUtils]: 9: Hoare triple {411#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} main_~l~0 := 1 + main_~l~0; {415#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:21,740 INFO L281 TraceCheckUtils]: 10: Hoare triple {415#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {415#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:21,740 INFO L281 TraceCheckUtils]: 11: Hoare triple {415#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {422#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:21,741 INFO L281 TraceCheckUtils]: 12: Hoare triple {422#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {378#false} is VALID [2021-09-13 14:14:21,741 INFO L281 TraceCheckUtils]: 13: Hoare triple {378#false} assume !false; {378#false} is VALID [2021-09-13 14:14:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:21,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:21,961 INFO L281 TraceCheckUtils]: 13: Hoare triple {378#false} assume !false; {378#false} is VALID [2021-09-13 14:14:21,962 INFO L281 TraceCheckUtils]: 12: Hoare triple {422#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {378#false} is VALID [2021-09-13 14:14:21,964 INFO L281 TraceCheckUtils]: 11: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {422#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:21,964 INFO L281 TraceCheckUtils]: 10: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,965 INFO L281 TraceCheckUtils]: 9: Hoare triple {442#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))} main_~l~0 := 1 + main_~l~0; {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,978 INFO L281 TraceCheckUtils]: 8: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {442#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))} is VALID [2021-09-13 14:14:21,979 INFO L281 TraceCheckUtils]: 7: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,979 INFO L281 TraceCheckUtils]: 6: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,980 INFO L281 TraceCheckUtils]: 5: Hoare triple {442#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))} main_~l~0 := 1 + main_~l~0; {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:24,087 INFO L281 TraceCheckUtils]: 4: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {442#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296))} is UNKNOWN [2021-09-13 14:14:24,088 INFO L281 TraceCheckUtils]: 3: Hoare triple {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:24,089 INFO L281 TraceCheckUtils]: 2: Hoare triple {377#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);main_~i~0 := 0;main_~j~0 := 0;main_~k~0 := 0;main_~l~0 := 0; {435#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:24,089 INFO L281 TraceCheckUtils]: 1: Hoare triple {377#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~l~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {377#true} is VALID [2021-09-13 14:14:24,089 INFO L281 TraceCheckUtils]: 0: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {377#true} is VALID [2021-09-13 14:14:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-09-13 14:14:24,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032668391] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:24,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:24,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 8] total 12 [2021-09-13 14:14:24,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189388953] [2021-09-13 14:14:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 14 [2021-09-13 14:14:24,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:24,090 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), 5 states have internal predecessors, (12), 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) [2021-09-13 14:14:26,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 11 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:26,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:26,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:26,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:14:26,233 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-09-13 14:14:28,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:28,525 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2021-09-13 14:14:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:28,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 14 [2021-09-13 14:14:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-09-13 14:14:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-09-13 14:14:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-09-13 14:14:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-09-13 14:14:28,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2021-09-13 14:14:30,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 12 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:30,689 INFO L225 Difference]: With dead ends: 16 [2021-09-13 14:14:30,689 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:14:30,690 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 157.76ms TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:14:30,690 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2064.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2231.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:30,691 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 2231.32ms Time] [2021-09-13 14:14:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:14:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:14:30,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:30,691 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) [2021-09-13 14:14:30,692 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) [2021-09-13 14:14:30,692 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) [2021-09-13 14:14:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,692 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:14:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:30,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:30,692 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. [2021-09-13 14:14:30,692 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. [2021-09-13 14:14:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,693 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:14:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:30,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:30,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:30,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:30,693 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) [2021-09-13 14:14:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:14:30,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2021-09-13 14:14:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:30,694 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:14:30,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-09-13 14:14:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:30,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:14:30,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:30,907 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 [2021-09-13 14:14:30,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:14:30,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:30,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:30,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:30,922 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L861 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 31) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2021-09-13 14:14:30,923 INFO L858 garLoopResultBuilder]: For program point L28-2(lines 26 31) no Hoare annotation was computed. [2021-09-13 14:14:30,924 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2021-09-13 14:14:30,924 INFO L854 garLoopResultBuilder]: At program point L24-2(lines 24 33) the Hoare annotation is: (= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296)) [2021-09-13 14:14:30,924 INFO L858 garLoopResultBuilder]: For program point L24-3(lines 24 33) no Hoare annotation was computed. [2021-09-13 14:14:30,924 INFO L858 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2021-09-13 14:14:30,924 INFO L861 garLoopResultBuilder]: At program point L35(lines 16 36) the Hoare annotation is: true [2021-09-13 14:14:30,927 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:14:30,929 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:14:30,929 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:14:30,929 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2021-09-13 14:14:30,929 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2021-09-13 14:14:30,929 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:14:30,929 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2021-09-13 14:14:30,930 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:14:30,931 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:14:30,931 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:14:30,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:14:30 BoogieIcfgContainer [2021-09-13 14:14:30,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:14:30,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:14:30,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:14:30,939 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:14:30,940 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:13:59" (3/4) ... [2021-09-13 14:14:30,942 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:14:30,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:14:30,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:14:30,949 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:14:30,949 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:14:30,973 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:14:30,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:14:30,974 INFO L158 Benchmark]: Toolchain (without parser) took 31857.69ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 46.0MB in the beginning and 45.2MB in the end (delta: 763.7kB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2021-09-13 14:14:30,974 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 47.4MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:30,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.45ms. Allocated memory is still 65.0MB. Free memory was 45.9MB in the beginning and 35.7MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:14:30,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.32ms. Allocated memory is still 65.0MB. Free memory was 35.7MB in the beginning and 48.9MB in the end (delta: -13.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:14:30,975 INFO L158 Benchmark]: Boogie Preprocessor took 11.66ms. Allocated memory is still 65.0MB. Free memory was 48.9MB in the beginning and 47.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:30,975 INFO L158 Benchmark]: RCFGBuilder took 222.73ms. Allocated memory is still 65.0MB. Free memory was 47.8MB in the beginning and 38.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:14:30,975 INFO L158 Benchmark]: TraceAbstraction took 31383.42ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 37.6MB in the beginning and 47.3MB in the end (delta: -9.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2021-09-13 14:14:30,976 INFO L158 Benchmark]: Witness Printer took 33.87ms. Allocated memory is still 88.1MB. Free memory was 47.3MB in the beginning and 45.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:14:30,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 47.4MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.45ms. Allocated memory is still 65.0MB. Free memory was 45.9MB in the beginning and 35.7MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.32ms. Allocated memory is still 65.0MB. Free memory was 35.7MB in the beginning and 48.9MB in the end (delta: -13.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.66ms. Allocated memory is still 65.0MB. Free memory was 48.9MB in the beginning and 47.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 222.73ms. Allocated memory is still 65.0MB. Free memory was 47.8MB in the beginning and 38.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31383.42ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 37.6MB in the beginning and 47.3MB in the end (delta: -9.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 33.87ms. Allocated memory is still 88.1MB. Free memory was 47.3MB in the beginning and 45.2MB in the end (delta: 2.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.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: 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 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31297.27ms, OverallIterations: 5, TraceHistogramMax: 2, EmptinessCheckTime: 27.29ms, AutomataDifference: 17958.87ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 14.48ms, InitialAbstractionConstructionTime: 6.31ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 11088.29ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10236.15ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 152 mSolverCounterSat, 2.32ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 445.16ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 46.17ms AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 12 HoareAnnotationTreeSize, 3 FomulaSimplifications, 94 FormulaSimplificationTreeSizeReduction, 6.33ms HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.02ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 23.19ms SsaConstructionTime, 116.44ms SatisfiabilityAnalysisTime, 6019.99ms InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 10 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/19 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: 24]: Loop Invariant Derived loop invariant: (k + j + i) % 4294967296 == l % 4294967296 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:14:31,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...