/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 13:49:39,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 13:49:39,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 13:49:39,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 13:49:39,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 13:49:39,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 13:49:39,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 13:49:39,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 13:49:39,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 13:49:39,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 13:49:39,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 13:49:39,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 13:49:39,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 13:49:39,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 13:49:39,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 13:49:39,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 13:49:39,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 13:49:39,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 13:49:39,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 13:49:39,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 13:49:39,345 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 13:49:39,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 13:49:39,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 13:49:39,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 13:49:39,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 13:49:39,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 13:49:39,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 13:49:39,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 13:49:39,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 13:49:39,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 13:49:39,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 13:49:39,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 13:49:39,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 13:49:39,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 13:49:39,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 13:49:39,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 13:49:39,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 13:49:39,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 13:49:39,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 13:49:39,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 13:49:39,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 13:49:39,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 13:49:39,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 13:49:39,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 13:49:39,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 13:49:39,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 13:49:39,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 13:49:39,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 13:49:39,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 13:49:39,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 13:49:39,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 13:49:39,380 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 13:49:39,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 13:49:39,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 13:49:39,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 13:49:39,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 13:49:39,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 13:49:39,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 13:49:39,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 13:49:39,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 13:49:39,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 13:49:39,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 13:49:39,382 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 13:49:39,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 13:49:39,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 13:49:39,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 13:49:39,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 13:49:39,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 13:49:39,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 13:49:39,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 13:49:39,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 13:49:39,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 13:49:39,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 13:49:39,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 13:49:39,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 13:49:39,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 13:49:39,385 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 13:49:39,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 13:49:39,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 13:49:39,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 13:49:39,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 13:49:39,621 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 13:49:39,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-14 13:49:39,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a25da7e7/45f6ebcedacd43edaf1b671a91c1df51/FLAG7844b6d23 [2022-04-14 13:49:40,017 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 13:49:40,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-14 13:49:40,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a25da7e7/45f6ebcedacd43edaf1b671a91c1df51/FLAG7844b6d23 [2022-04-14 13:49:40,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a25da7e7/45f6ebcedacd43edaf1b671a91c1df51 [2022-04-14 13:49:40,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 13:49:40,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 13:49:40,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 13:49:40,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 13:49:40,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 13:49:40,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60910bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40, skipping insertion in model container [2022-04-14 13:49:40,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 13:49:40,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 13:49:40,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-04-14 13:49:40,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 13:49:40,247 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 13:49:40,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-04-14 13:49:40,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 13:49:40,275 INFO L208 MainTranslator]: Completed translation [2022-04-14 13:49:40,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40 WrapperNode [2022-04-14 13:49:40,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 13:49:40,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 13:49:40,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 13:49:40,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 13:49:40,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 13:49:40,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 13:49:40,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 13:49:40,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 13:49:40,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (1/1) ... [2022-04-14 13:49:40,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 13:49:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 13:49:40,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 13:49:40,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 13:49:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 13:49:40,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 13:49:40,360 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 13:49:40,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 13:49:40,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 13:49:40,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 13:49:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 13:49:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 13:49:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 13:49:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 13:49:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 13:49:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 13:49:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 13:49:40,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 13:49:40,413 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 13:49:40,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 13:49:40,520 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 13:49:40,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 13:49:40,526 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 13:49:40,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:49:40 BoogieIcfgContainer [2022-04-14 13:49:40,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 13:49:40,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 13:49:40,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 13:49:40,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 13:49:40,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:49:40" (1/3) ... [2022-04-14 13:49:40,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1958a0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:49:40, skipping insertion in model container [2022-04-14 13:49:40,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:49:40" (2/3) ... [2022-04-14 13:49:40,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1958a0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:49:40, skipping insertion in model container [2022-04-14 13:49:40,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:49:40" (3/3) ... [2022-04-14 13:49:40,535 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2022-04-14 13:49:40,539 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 13:49:40,539 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 13:49:40,577 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 13:49:40,582 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 13:49:40,582 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 13:49:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 13:49:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 13:49:40,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:49:40,605 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:49:40,605 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:49:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:49:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 1 times [2022-04-14 13:49:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:49:40,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994244865] [2022-04-14 13:49:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:49:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:49:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:40,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-14 13:49:40,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-14 13:49:40,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-14 13:49:40,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 13:49:40,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-14 13:49:40,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-14 13:49:40,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-14 13:49:40,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-14 13:49:40,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {26#true} is VALID [2022-04-14 13:49:40,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume 0 != ~flag~0;~i~0 := 0; {26#true} is VALID [2022-04-14 13:49:40,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-14 13:49:40,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 != ~flag~0; {27#false} is VALID [2022-04-14 13:49:40,787 INFO L272 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-14 13:49:40,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-14 13:49:40,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-14 13:49:40,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-14 13:49:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:49:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994244865] [2022-04-14 13:49:40,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994244865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 13:49:40,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 13:49:40,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 13:49:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389298403] [2022-04-14 13:49:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 13:49:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 13:49:40,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:49:40,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:40,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:40,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 13:49:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:49:40,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 13:49:40,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 13:49:40,875 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:40,981 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-14 13:49:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 13:49:40,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 13:49:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:49:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-14 13:49:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-14 13:49:40,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-14 13:49:41,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:41,064 INFO L225 Difference]: With dead ends: 36 [2022-04-14 13:49:41,064 INFO L226 Difference]: Without dead ends: 16 [2022-04-14 13:49:41,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 13:49:41,069 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 13:49:41,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 13:49:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-14 13:49:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-14 13:49:41,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:49:41,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,098 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,098 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:41,101 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-14 13:49:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 13:49:41,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:41,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:41,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-14 13:49:41,102 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-14 13:49:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:41,104 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-14 13:49:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 13:49:41,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:41,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:41,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:49:41,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:49:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-14 13:49:41,110 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-14 13:49:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:49:41,110 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-14 13:49:41,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 13:49:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 13:49:41,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:49:41,111 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:49:41,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 13:49:41,112 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:49:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:49:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 1 times [2022-04-14 13:49:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:49:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190909459] [2022-04-14 13:49:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:49:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:49:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:41,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {132#true} is VALID [2022-04-14 13:49:41,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-14 13:49:41,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132#true} {132#true} #68#return; {132#true} is VALID [2022-04-14 13:49:41,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 13:49:41,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {132#true} is VALID [2022-04-14 13:49:41,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2022-04-14 13:49:41,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #68#return; {132#true} is VALID [2022-04-14 13:49:41,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret5 := main(); {132#true} is VALID [2022-04-14 13:49:41,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {137#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:41,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#(and (= main_~a~0 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {137#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:41,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#(and (= main_~a~0 0) (= main_~b~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {137#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:41,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {137#(and (= main_~a~0 0) (= main_~b~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {137#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:41,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#(and (= main_~a~0 0) (= main_~b~0 0))} assume 0 != ~flag~0; {137#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:41,298 INFO L272 TraceCheckUtils]: 10: Hoare triple {137#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {138#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 13:49:41,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {139#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 13:49:41,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {139#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {133#false} is VALID [2022-04-14 13:49:41,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-04-14 13:49:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:49:41,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190909459] [2022-04-14 13:49:41,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190909459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 13:49:41,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 13:49:41,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 13:49:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577634845] [2022-04-14 13:49:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 13:49:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 13:49:41,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:49:41,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:41,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 13:49:41,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:49:41,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 13:49:41,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 13:49:41,318 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:41,486 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-14 13:49:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 13:49:41,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 13:49:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:49:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-14 13:49:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-14 13:49:41,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-14 13:49:41,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:41,531 INFO L225 Difference]: With dead ends: 24 [2022-04-14 13:49:41,531 INFO L226 Difference]: Without dead ends: 18 [2022-04-14 13:49:41,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 13:49:41,538 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 13:49:41,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 13:49:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-14 13:49:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-14 13:49:41,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:49:41,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,546 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,546 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:41,549 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-14 13:49:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 13:49:41,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:41,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:41,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-14 13:49:41,550 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-14 13:49:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:41,552 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-14 13:49:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 13:49:41,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:41,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:41,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:49:41,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:49:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-14 13:49:41,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-14 13:49:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:49:41,554 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-14 13:49:41,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 13:49:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 13:49:41,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:49:41,555 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:49:41,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 13:49:41,555 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:49:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:49:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 1 times [2022-04-14 13:49:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:49:41,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747725817] [2022-04-14 13:49:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:49:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:49:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:41,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {241#true} is VALID [2022-04-14 13:49:41,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-14 13:49:41,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} #68#return; {241#true} is VALID [2022-04-14 13:49:41,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 13:49:41,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {241#true} is VALID [2022-04-14 13:49:41,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-14 13:49:41,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #68#return; {241#true} is VALID [2022-04-14 13:49:41,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret5 := main(); {241#true} is VALID [2022-04-14 13:49:41,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {246#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:41,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:41,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:41,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {248#(and (= (+ (- 1) main_~j~0) 0) (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:41,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(and (= (+ (- 1) main_~j~0) 0) (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:41,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:41,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:41,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:41,981 INFO L272 TraceCheckUtils]: 13: Hoare triple {249#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {250#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 13:49:41,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {250#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {251#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 13:49:41,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {242#false} is VALID [2022-04-14 13:49:41,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-04-14 13:49:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:49:41,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747725817] [2022-04-14 13:49:41,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747725817] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 13:49:41,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255962943] [2022-04-14 13:49:41,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:49:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 13:49:41,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 13:49:41,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 13:49:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:42,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 13:49:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:42,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 13:49:42,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2022-04-14 13:49:42,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {241#true} is VALID [2022-04-14 13:49:42,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-14 13:49:42,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #68#return; {241#true} is VALID [2022-04-14 13:49:42,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret5 := main(); {241#true} is VALID [2022-04-14 13:49:42,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {246#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:42,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:42,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:42,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:42,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:42,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:42,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:42,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume 0 != ~flag~0; {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:42,302 INFO L272 TraceCheckUtils]: 13: Hoare triple {280#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 13:49:42,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 13:49:42,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {242#false} is VALID [2022-04-14 13:49:42,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-04-14 13:49:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:42,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 13:49:42,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-04-14 13:49:42,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {300#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {242#false} is VALID [2022-04-14 13:49:42,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 13:49:42,476 INFO L272 TraceCheckUtils]: 13: Hoare triple {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 13:49:42,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:42,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:42,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:42,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:42,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {316#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:42,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {332#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-14 13:49:42,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {332#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-14 13:49:42,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {339#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0) 4294967296))} is VALID [2022-04-14 13:49:42,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret5 := main(); {241#true} is VALID [2022-04-14 13:49:42,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #68#return; {241#true} is VALID [2022-04-14 13:49:42,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-04-14 13:49:42,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {241#true} is VALID [2022-04-14 13:49:42,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2022-04-14 13:49:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:42,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255962943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 13:49:42,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 13:49:42,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-14 13:49:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38156543] [2022-04-14 13:49:42,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 13:49:42,492 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 13:49:42,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:49:42,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:42,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 13:49:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:49:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 13:49:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-14 13:49:42,536 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:42,900 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-14 13:49:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 13:49:42,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 13:49:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:49:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-14 13:49:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-14 13:49:42,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-14 13:49:42,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:42,942 INFO L225 Difference]: With dead ends: 29 [2022-04-14 13:49:42,943 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 13:49:42,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-04-14 13:49:42,944 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 13:49:42,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 13:49:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 13:49:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-14 13:49:42,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:49:42,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,947 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,948 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:42,949 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-14 13:49:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-14 13:49:42,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:42,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:42,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-14 13:49:42,950 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-14 13:49:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:42,951 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-14 13:49:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-14 13:49:42,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:42,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:42,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:49:42,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:49:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-14 13:49:42,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-14 13:49:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:49:42,953 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-14 13:49:42,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-14 13:49:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 13:49:42,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:49:42,954 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:49:42,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 13:49:43,176 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:49:43,177 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:49:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:49:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 1 times [2022-04-14 13:49:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:49:43,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507188317] [2022-04-14 13:49:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:49:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:43,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:49:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:43,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {482#true} is VALID [2022-04-14 13:49:43,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-14 13:49:43,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} #68#return; {482#true} is VALID [2022-04-14 13:49:43,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 13:49:43,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {482#true} is VALID [2022-04-14 13:49:43,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-14 13:49:43,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #68#return; {482#true} is VALID [2022-04-14 13:49:43,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret5 := main(); {482#true} is VALID [2022-04-14 13:49:43,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {482#true} is VALID [2022-04-14 13:49:43,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {482#true} assume !(0 != ~flag~0);~i~0 := 1; {487#(= main_~flag~0 0)} is VALID [2022-04-14 13:49:43,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {487#(= main_~flag~0 0)} is VALID [2022-04-14 13:49:43,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= main_~flag~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {487#(= main_~flag~0 0)} is VALID [2022-04-14 13:49:43,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {487#(= main_~flag~0 0)} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {487#(= main_~flag~0 0)} is VALID [2022-04-14 13:49:43,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {487#(= main_~flag~0 0)} is VALID [2022-04-14 13:49:43,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#(= main_~flag~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {487#(= main_~flag~0 0)} is VALID [2022-04-14 13:49:43,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {487#(= main_~flag~0 0)} assume 0 != ~flag~0; {483#false} is VALID [2022-04-14 13:49:43,221 INFO L272 TraceCheckUtils]: 13: Hoare triple {483#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {483#false} is VALID [2022-04-14 13:49:43,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#false} ~cond := #in~cond; {483#false} is VALID [2022-04-14 13:49:43,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#false} assume 0 == ~cond; {483#false} is VALID [2022-04-14 13:49:43,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {483#false} assume !false; {483#false} is VALID [2022-04-14 13:49:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 13:49:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:49:43,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507188317] [2022-04-14 13:49:43,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507188317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 13:49:43,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 13:49:43,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 13:49:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489526493] [2022-04-14 13:49:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 13:49:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 13:49:43,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:49:43,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:43,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 13:49:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:49:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 13:49:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 13:49:43,235 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:43,287 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-14 13:49:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 13:49:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 13:49:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:49:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-14 13:49:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-14 13:49:43,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-14 13:49:43,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:43,316 INFO L225 Difference]: With dead ends: 32 [2022-04-14 13:49:43,316 INFO L226 Difference]: Without dead ends: 21 [2022-04-14 13:49:43,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 13:49:43,322 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 13:49:43,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 13:49:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-14 13:49:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-14 13:49:43,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:49:43,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,328 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,328 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:43,330 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-14 13:49:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-14 13:49:43,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:43,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:43,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-14 13:49:43,332 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-14 13:49:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:43,335 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-14 13:49:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-14 13:49:43,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:43,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:43,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:49:43,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:49:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-14 13:49:43,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-14 13:49:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:49:43,341 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-14 13:49:43,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-14 13:49:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 13:49:43,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:49:43,342 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:49:43,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 13:49:43,343 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:49:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:49:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 2 times [2022-04-14 13:49:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:49:43,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131830451] [2022-04-14 13:49:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:49:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:49:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:43,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {602#true} is VALID [2022-04-14 13:49:43,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} assume true; {602#true} is VALID [2022-04-14 13:49:43,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {602#true} {602#true} #68#return; {602#true} is VALID [2022-04-14 13:49:43,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 13:49:43,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {602#true} is VALID [2022-04-14 13:49:43,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2022-04-14 13:49:43,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} #68#return; {602#true} is VALID [2022-04-14 13:49:43,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {602#true} call #t~ret5 := main(); {602#true} is VALID [2022-04-14 13:49:43,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {602#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {607#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:43,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:43,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:43,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {609#(and (<= (+ main_~b~0 3) (+ main_~i~0 main_~a~0 main_~j~0)) (<= (+ main_~i~0 main_~a~0 main_~j~0) (+ main_~b~0 3)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-14 13:49:43,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {609#(and (<= (+ main_~b~0 3) (+ main_~i~0 main_~a~0 main_~j~0)) (<= (+ main_~i~0 main_~a~0 main_~j~0) (+ main_~b~0 3)) (= (+ (- 1) main_~j~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {610#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-14 13:49:43,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {610#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-14 13:49:43,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:43,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:43,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:43,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:43,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-14 13:49:43,554 INFO L272 TraceCheckUtils]: 16: Hoare triple {611#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 13:49:43,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {612#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {613#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 13:49:43,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {603#false} is VALID [2022-04-14 13:49:43,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-04-14 13:49:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:43,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:49:43,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131830451] [2022-04-14 13:49:43,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131830451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 13:49:43,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476247108] [2022-04-14 13:49:43,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 13:49:43,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:49:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 13:49:43,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 13:49:43,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 13:49:43,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 13:49:43,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 13:49:43,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 13:49:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:43,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 13:49:43,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2022-04-14 13:49:43,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {602#true} is VALID [2022-04-14 13:49:43,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2022-04-14 13:49:43,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} #68#return; {602#true} is VALID [2022-04-14 13:49:43,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {602#true} call #t~ret5 := main(); {602#true} is VALID [2022-04-14 13:49:43,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {602#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {607#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-14 13:49:43,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:43,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-14 13:49:43,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {608#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {642#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-14 13:49:43,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {646#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:43,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {646#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {646#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-14 13:49:43,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {646#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-14 13:49:43,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-14 13:49:43,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-14 13:49:43,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume !(0 != #t~nondet2);havoc #t~nondet2; {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-14 13:49:43,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume 0 != ~flag~0; {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-14 13:49:43,859 INFO L272 TraceCheckUtils]: 16: Hoare triple {653#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 13:49:43,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {669#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 13:49:43,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {673#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {603#false} is VALID [2022-04-14 13:49:43,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-04-14 13:49:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:43,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 13:49:44,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-04-14 13:49:44,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {673#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {603#false} is VALID [2022-04-14 13:49:44,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {669#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 13:49:44,066 INFO L272 TraceCheckUtils]: 16: Hoare triple {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 13:49:44,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:44,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:44,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:44,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:44,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {689#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-14 13:49:44,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {705#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {705#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-14 13:49:44,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {705#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-14 13:49:44,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {712#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-14 13:49:44,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {716#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-14 13:49:44,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {723#(= (mod (+ (* main_~j~0 2) main_~b~0) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {716#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-14 13:49:44,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {602#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {723#(= (mod (+ (* main_~j~0 2) main_~b~0) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-14 13:49:44,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {602#true} call #t~ret5 := main(); {602#true} is VALID [2022-04-14 13:49:44,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} #68#return; {602#true} is VALID [2022-04-14 13:49:44,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2022-04-14 13:49:44,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {602#true} is VALID [2022-04-14 13:49:44,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2022-04-14 13:49:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 13:49:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476247108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 13:49:44,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 13:49:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-14 13:49:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951854653] [2022-04-14 13:49:44,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 13:49:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 13:49:44,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:49:44,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:44,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:44,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-14 13:49:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:49:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-14 13:49:44,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-14 13:49:44,134 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:51,211 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-14 13:49:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-14 13:49:51,211 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 13:49:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:49:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-14 13:49:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-14 13:49:51,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 59 transitions. [2022-04-14 13:49:53,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:53,496 INFO L225 Difference]: With dead ends: 52 [2022-04-14 13:49:53,496 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 13:49:53,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-04-14 13:49:53,497 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-14 13:49:53,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 72 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-14 13:49:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 13:49:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-14 13:49:53,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:49:53,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:53,500 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:53,500 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:53,501 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 13:49:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 13:49:53,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:53,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:53,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-14 13:49:53,502 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-14 13:49:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:53,503 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 13:49:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 13:49:53,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:53,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:53,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:49:53,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:49:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-14 13:49:53,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-04-14 13:49:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:49:53,505 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-14 13:49:53,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-14 13:49:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 13:49:53,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:49:53,506 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:49:53,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 13:49:53,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:49:53,707 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:49:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:49:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 1 times [2022-04-14 13:49:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:49:53,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879013858] [2022-04-14 13:49:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:49:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:49:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:53,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {925#true} is VALID [2022-04-14 13:49:53,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-14 13:49:53,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #68#return; {925#true} is VALID [2022-04-14 13:49:53,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 13:49:53,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {925#true} is VALID [2022-04-14 13:49:53,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-14 13:49:53,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #68#return; {925#true} is VALID [2022-04-14 13:49:53,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2022-04-14 13:49:53,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {925#true} is VALID [2022-04-14 13:49:53,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#true} assume 0 != ~flag~0;~i~0 := 0; {930#(= main_~i~0 0)} is VALID [2022-04-14 13:49:53,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {930#(= main_~i~0 0)} is VALID [2022-04-14 13:49:53,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-14 13:49:53,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-14 13:49:53,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-14 13:49:53,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {932#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 4 main_~i~0))} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 4 main_~i~0))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {926#false} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {926#false} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {926#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {926#false} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {926#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {926#false} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {926#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {926#false} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {926#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {926#false} is VALID [2022-04-14 13:49:53,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {926#false} assume 0 != ~flag~0; {926#false} is VALID [2022-04-14 13:49:53,825 INFO L272 TraceCheckUtils]: 19: Hoare triple {926#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {926#false} is VALID [2022-04-14 13:49:53,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-04-14 13:49:53,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {926#false} assume 0 == ~cond; {926#false} is VALID [2022-04-14 13:49:53,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-14 13:49:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 13:49:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:49:53,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879013858] [2022-04-14 13:49:53,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879013858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 13:49:53,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796077498] [2022-04-14 13:49:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:49:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:49:53,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 13:49:53,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 13:49:53,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 13:49:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:53,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 13:49:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:49:53,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 13:49:54,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-14 13:49:54,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {925#true} is VALID [2022-04-14 13:49:54,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-14 13:49:54,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #68#return; {925#true} is VALID [2022-04-14 13:49:54,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2022-04-14 13:49:54,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {925#true} is VALID [2022-04-14 13:49:54,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#true} assume 0 != ~flag~0;~i~0 := 0; {930#(= main_~i~0 0)} is VALID [2022-04-14 13:49:54,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {930#(= main_~i~0 0)} is VALID [2022-04-14 13:49:54,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-14 13:49:54,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-14 13:49:54,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-14 13:49:54,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {970#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-14 13:49:54,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {970#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {926#false} is VALID [2022-04-14 13:49:54,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {926#false} is VALID [2022-04-14 13:49:54,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {926#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {926#false} is VALID [2022-04-14 13:49:54,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {926#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {926#false} is VALID [2022-04-14 13:49:54,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {926#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {926#false} is VALID [2022-04-14 13:49:54,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {926#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {926#false} is VALID [2022-04-14 13:49:54,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {926#false} assume 0 != ~flag~0; {926#false} is VALID [2022-04-14 13:49:54,125 INFO L272 TraceCheckUtils]: 19: Hoare triple {926#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {926#false} is VALID [2022-04-14 13:49:54,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-04-14 13:49:54,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {926#false} assume 0 == ~cond; {926#false} is VALID [2022-04-14 13:49:54,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-14 13:49:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 13:49:54,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 13:49:54,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-14 13:49:54,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {926#false} assume 0 == ~cond; {926#false} is VALID [2022-04-14 13:49:54,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-04-14 13:49:54,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {926#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {926#false} assume 0 != ~flag~0; {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {926#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {926#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {926#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {926#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {926#false} is VALID [2022-04-14 13:49:54,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {1034#(= 0 (mod main_~i~0 2))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {926#false} is VALID [2022-04-14 13:49:54,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {1034#(= 0 (mod main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1034#(= 0 (mod main_~i~0 2))} is VALID [2022-04-14 13:49:54,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {1034#(= 0 (mod main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1034#(= 0 (mod main_~i~0 2))} is VALID [2022-04-14 13:49:54,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {1034#(= 0 (mod main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1034#(= 0 (mod main_~i~0 2))} is VALID [2022-04-14 13:49:54,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {1034#(= 0 (mod main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1034#(= 0 (mod main_~i~0 2))} is VALID [2022-04-14 13:49:54,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1034#(= 0 (mod main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1034#(= 0 (mod main_~i~0 2))} is VALID [2022-04-14 13:49:54,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#true} assume 0 != ~flag~0;~i~0 := 0; {1034#(= 0 (mod main_~i~0 2))} is VALID [2022-04-14 13:49:54,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {925#true} is VALID [2022-04-14 13:49:54,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2022-04-14 13:49:54,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #68#return; {925#true} is VALID [2022-04-14 13:49:54,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-14 13:49:54,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {925#true} is VALID [2022-04-14 13:49:54,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-14 13:49:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 13:49:54,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796077498] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 13:49:54,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 13:49:54,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 8 [2022-04-14 13:49:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14060574] [2022-04-14 13:49:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 13:49:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 13:49:54,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:49:54,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:54,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:54,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 13:49:54,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:49:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 13:49:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-14 13:49:54,228 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:54,240 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-14 13:49:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 13:49:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 13:49:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:49:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-14 13:49:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-14 13:49:54,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-04-14 13:49:54,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 13:49:54,256 INFO L225 Difference]: With dead ends: 24 [2022-04-14 13:49:54,256 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 13:49:54,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-14 13:49:54,257 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 13:49:54,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 13:49:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 13:49:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 13:49:54,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:49:54,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 13:49:54,258 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 13:49:54,258 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 13:49:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:54,259 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 13:49:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 13:49:54,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:54,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:54,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 13:49:54,259 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 13:49:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:49:54,259 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 13:49:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 13:49:54,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:54,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:49:54,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:49:54,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:49:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 13:49:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 13:49:54,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-14 13:49:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:49:54,260 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 13:49:54,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 13:49:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 13:49:54,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:49:54,263 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 13:49:54,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 13:49:54,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:49:54,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-14 13:49:54,529 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point L35-2(lines 24 49) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 49) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296)) [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 49) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point L45(lines 45 47) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point L39-2(lines 24 49) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 44) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 13:49:54,530 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 13:49:54,531 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-14 13:49:54,531 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-14 13:49:54,534 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-14 13:49:54,535 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 13:49:54,538 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 13:49:54,538 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 13:49:54,538 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-14 13:49:54,539 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 13:49:54,540 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 13:49:54,540 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 13:49:54,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:49:54 BoogieIcfgContainer [2022-04-14 13:49:54,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 13:49:54,542 INFO L158 Benchmark]: Toolchain (without parser) took 14506.54ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 122.0MB in the beginning and 84.2MB in the end (delta: 37.8MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. [2022-04-14 13:49:54,542 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 13:49:54,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.85ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 121.7MB in the beginning and 231.6MB in the end (delta: -109.9MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-14 13:49:54,543 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 260.0MB. Free memory was 231.6MB in the beginning and 230.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 13:49:54,543 INFO L158 Benchmark]: RCFGBuilder took 224.03ms. Allocated memory is still 260.0MB. Free memory was 230.1MB in the beginning and 218.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 13:49:54,543 INFO L158 Benchmark]: TraceAbstraction took 14011.76ms. Allocated memory is still 260.0MB. Free memory was 218.1MB in the beginning and 84.7MB in the end (delta: 133.4MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. [2022-04-14 13:49:54,544 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.12ms. Allocated memory is still 178.3MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.85ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 121.7MB in the beginning and 231.6MB in the end (delta: -109.9MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 260.0MB. Free memory was 231.6MB in the beginning and 230.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.03ms. Allocated memory is still 260.0MB. Free memory was 230.1MB in the beginning and 218.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14011.76ms. Allocated memory is still 260.0MB. Free memory was 218.1MB in the beginning and 84.7MB in the end (delta: 133.4MB). Peak memory consumption was 134.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 222 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 101 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 15 PreInvPairs, 21 NumberOfFragments, 18 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 80 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1322 SizeOfPredicates, 5 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 41/74 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 RESULT: Ultimate proved your program to be correct! [2022-04-14 13:49:54,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...