/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/nla-digbench-scaling/dijkstra-u_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:15:59,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:15:59,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:15:59,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:15:59,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:15:59,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:15:59,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:15:59,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:15:59,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:15:59,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:15:59,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:15:59,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:15:59,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:15:59,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:15:59,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:15:59,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:15:59,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:15:59,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:15:59,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:15:59,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:15:59,513 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:15:59,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:15:59,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:15:59,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:15:59,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:15:59,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:15:59,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:15:59,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:15:59,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:15:59,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:15:59,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:15:59,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:15:59,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:15:59,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:15:59,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:15:59,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:15:59,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:15:59,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:15:59,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:15:59,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:15:59,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:15:59,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:15:59,541 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 15:15:59,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:15:59,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:15:59,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:15:59,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:15:59,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:15:59,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:15:59,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:15:59,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:15:59,563 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:15:59,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:15:59,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:15:59,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:15:59,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:15:59,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:15:59,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:15:59,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:15:59,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:15:59,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:15:59,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:15:59,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:15:59,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:15:59,567 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 15:15:59,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:15:59,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:15:59,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:15:59,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:15:59,783 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:15:59,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-14 15:15:59,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf831e62d/0a7d76c7062a47b6b52ff43140f31e3d/FLAG86c6982c6 [2022-04-14 15:16:00,246 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:16:00,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-14 15:16:00,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf831e62d/0a7d76c7062a47b6b52ff43140f31e3d/FLAG86c6982c6 [2022-04-14 15:16:00,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf831e62d/0a7d76c7062a47b6b52ff43140f31e3d [2022-04-14 15:16:00,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:16:00,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:16:00,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:00,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:16:00,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:16:00,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7632879e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00, skipping insertion in model container [2022-04-14 15:16:00,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:16:00,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:16:00,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c[525,538] [2022-04-14 15:16:00,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:00,466 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:16:00,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c[525,538] [2022-04-14 15:16:00,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:00,500 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:16:00,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00 WrapperNode [2022-04-14 15:16:00,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:00,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:16:00,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:16:00,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:16:00,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:16:00,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:16:00,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:16:00,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:16:00,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (1/1) ... [2022-04-14 15:16:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:00,572 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 15:16:00,584 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 15:16:00,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:16:00,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:16:00,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:16:00,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:16:00,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:16:00,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:16:00,668 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:16:00,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:16:00,890 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:16:00,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:16:00,896 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:16:00,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:00 BoogieIcfgContainer [2022-04-14 15:16:00,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:16:00,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:16:00,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:16:00,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:16:00,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:16:00" (1/3) ... [2022-04-14 15:16:00,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5112a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:00, skipping insertion in model container [2022-04-14 15:16:00,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:00" (2/3) ... [2022-04-14 15:16:00,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5112a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:00, skipping insertion in model container [2022-04-14 15:16:00,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:00" (3/3) ... [2022-04-14 15:16:00,904 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound20.c [2022-04-14 15:16:00,908 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:16:00,908 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:16:00,943 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:16:00,948 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 15:16:00,948 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:16:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 15:16:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 15:16:00,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:00,972 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:00,972 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-14 15:16:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:00,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752054509] [2022-04-14 15:16:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:01,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:01,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-14 15:16:01,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:16:01,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:16:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:01,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:16:01,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:16:01,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:16:01,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:16:01,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:16:01,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-14 15:16:01,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:16:01,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:16:01,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-14 15:16:01,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-14 15:16:01,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-14 15:16:01,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:16:01,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:16:01,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:16:01,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:16:01,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-14 15:16:01,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:16:01,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:16:01,153 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-14 15:16:01,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-14 15:16:01,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-14 15:16:01,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-14 15:16:01,154 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 15:16:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752054509] [2022-04-14 15:16:01,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752054509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:01,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:01,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:16:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976071116] [2022-04-14 15:16:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 15:16:01,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:01,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:01,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:01,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:16:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:01,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:16:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:16:01,233 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:07,781 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-14 15:16:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:16:07,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 15:16:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:07,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-14 15:16:07,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:07,974 INFO L225 Difference]: With dead ends: 70 [2022-04-14 15:16:07,975 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:16:07,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 15:16:07,983 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:07,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 15:16:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:16:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 15:16:08,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:08,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,026 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,027 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,042 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:08,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:08,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:08,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-14 15:16:08,044 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-14 15:16:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,048 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:08,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:08,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:08,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:08,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 15:16:08,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-14 15:16:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:08,060 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 15:16:08,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 15:16:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 15:16:08,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:08,063 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:08,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:16:08,064 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-14 15:16:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:08,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82795569] [2022-04-14 15:16:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:08,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:08,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023563597] [2022-04-14 15:16:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:08,112 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 15:16:08,123 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 15:16:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:16:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:08,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-14 15:16:08,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:08,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-14 15:16:08,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {275#false} is VALID [2022-04-14 15:16:08,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-14 15:16:08,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 20);havoc #t~post6; {275#false} is VALID [2022-04-14 15:16:08,379 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-14 15:16:08,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-14 15:16:08,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-14 15:16:08,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-14 15:16:08,380 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 15:16:08,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:08,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82795569] [2022-04-14 15:16:08,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023563597] [2022-04-14 15:16:08,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023563597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:08,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:08,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:16:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89182018] [2022-04-14 15:16:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 15:16:08,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:08,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:08,405 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 15:16:08,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 15:16:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 15:16:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:16:08,407 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:11,637 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-14 15:16:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 15:16:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 15:16:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:11,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:11,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 15:16:11,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:11,741 INFO L225 Difference]: With dead ends: 55 [2022-04-14 15:16:11,741 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:16:11,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:16:11,744 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:11,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:16:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:16:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:16:11,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:11,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:11,757 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:11,757 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:11,760 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:11,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:11,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:11,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 15:16:11,762 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 15:16:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:11,764 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:11,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:11,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:11,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:11,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-14 15:16:11,768 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-14 15:16:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:11,769 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-14 15:16:11,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:11,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:11,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:11,798 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 15:16:11,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:11,998 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:11,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-14 15:16:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:11,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807695090] [2022-04-14 15:16:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:12,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:12,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288681673] [2022-04-14 15:16:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:12,017 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 15:16:12,040 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 15:16:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:12,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:12,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:12,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-14 15:16:12,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,245 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:12,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:12,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:12,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:12,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-14 15:16:12,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {547#false} is VALID [2022-04-14 15:16:12,250 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {547#false} is VALID [2022-04-14 15:16:12,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-14 15:16:12,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-14 15:16:12,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-14 15:16:12,251 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 15:16:12,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807695090] [2022-04-14 15:16:12,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288681673] [2022-04-14 15:16:12,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288681673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:12,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:12,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:16:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339779309] [2022-04-14 15:16:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 15:16:12,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:12,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:12,271 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 15:16:12,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:16:12,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:12,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:16:12,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:12,272 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:19,390 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 15:16:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:16:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 15:16:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:19,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-14 15:16:19,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:19,456 INFO L225 Difference]: With dead ends: 49 [2022-04-14 15:16:19,457 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 15:16:19,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:19,458 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:19,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:16:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 15:16:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-14 15:16:19,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:19,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:19,467 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:19,467 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:19,469 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:19,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:19,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:19,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-14 15:16:19,471 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-14 15:16:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:19,473 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:19,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:19,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:19,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:19,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-14 15:16:19,476 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-14 15:16:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:19,477 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-14 15:16:19,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-14 15:16:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:19,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:19,478 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:19,503 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 15:16:19,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 15:16:19,691 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:19,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-14 15:16:19,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:19,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130792331] [2022-04-14 15:16:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:19,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-14 15:16:19,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:19,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:19,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:19,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:19,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:19,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:19,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:16:19,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-14 15:16:19,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:19,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:19,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-14 15:16:19,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-14 15:16:19,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-14 15:16:19,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:19,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:19,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:19,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:19,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:19,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:19,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:19,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-14 15:16:19,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-14 15:16:19,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-14 15:16:19,966 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:19,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:16:19,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-14 15:16:19,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-14 15:16:19,968 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 15:16:19,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:19,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130792331] [2022-04-14 15:16:19,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130792331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:19,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:19,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:16:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992055168] [2022-04-14 15:16:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 15:16:19,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:19,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:19,993 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 15:16:19,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:16:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:16:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:16:19,996 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:22,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:27,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:36,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:38,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:41,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:43,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:46,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:48,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:50,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:50,678 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-14 15:16:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:16:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 15:16:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:50,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-14 15:16:50,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:50,968 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:16:50,968 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 15:16:50,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:16:50,970 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:50,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 8 Unknown, 0 Unchecked, 22.2s Time] [2022-04-14 15:16:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 15:16:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 15:16:50,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:50,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:50,992 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:50,993 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:51,002 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:51,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:51,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:51,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-14 15:16:51,004 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-14 15:16:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:51,007 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:51,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:51,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:51,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:51,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-14 15:16:51,011 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-14 15:16:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:51,011 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-14 15:16:51,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 15:16:51,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:51,012 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:51,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 15:16:51,013 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-14 15:16:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:51,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514279921] [2022-04-14 15:16:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:51,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:51,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572631173] [2022-04-14 15:16:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:51,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:51,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:51,027 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 15:16:51,036 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 15:16:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:51,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:51,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:51,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:51,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:51,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:51,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:51,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:51,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-14 15:16:51,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:51,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:51,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 20);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:51,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-14 15:16:51,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:51,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:51,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:51,276 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 15:16:51,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:51,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:51,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:51,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:51,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-14 15:16:51,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 20);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:51,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:51,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:51,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 20)} is VALID [2022-04-14 15:16:51,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 20)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 20)} is VALID [2022-04-14 15:16:51,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1233#(< ~counter~0 20)} is VALID [2022-04-14 15:16:51,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 20)} is VALID [2022-04-14 15:16:51,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 19)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 19)} #82#return; {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-14 15:16:51,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-14 15:16:51,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-14 15:16:51,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 19)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-14 15:16:51,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 19)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 19)} call #t~ret7 := main(); {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 19)} {1137#true} #102#return; {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 19)} assume true; {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1243#(< ~counter~0 19)} is VALID [2022-04-14 15:16:51,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:51,461 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 15:16:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514279921] [2022-04-14 15:16:51,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572631173] [2022-04-14 15:16:51,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572631173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:51,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:51,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:16:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544465361] [2022-04-14 15:16:51,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-14 15:16:51,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:51,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:16:51,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:51,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:16:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:16:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:16:51,495 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:16:58,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:01,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:03,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:11,187 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-14 15:17:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:17:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-14 15:17:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-14 15:17:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-14 15:17:11,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-04-14 15:17:11,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:11,318 INFO L225 Difference]: With dead ends: 108 [2022-04-14 15:17:11,318 INFO L226 Difference]: Without dead ends: 89 [2022-04-14 15:17:11,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:17:11,319 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:11,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 244 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2022-04-14 15:17:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-14 15:17:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-14 15:17:11,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:11,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:11,345 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:11,345 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:11,349 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:17:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:17:11,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:11,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:11,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-14 15:17:11,350 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-14 15:17:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:11,355 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:17:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:17:11,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:11,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:11,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:11,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-14 15:17:11,358 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-14 15:17:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:11,359 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-14 15:17:11,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-14 15:17:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:11,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:11,360 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:11,384 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 15:17:11,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:11,576 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-14 15:17:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:11,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491111951] [2022-04-14 15:17:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:11,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:11,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974193247] [2022-04-14 15:17:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:11,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:17:11,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 15:17:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:17:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:11,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:17:11,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:11,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:11,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:11,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:11,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:11,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:11,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:11,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-14 15:17:11,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:17:11,825 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-14 15:17:11,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:17:11,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:17:11,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:17:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:11,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:12,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:17:12,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:17:12,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:17:12,007 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-14 15:17:12,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:17:12,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 20)} is VALID [2022-04-14 15:17:12,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 20)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 20)} is VALID [2022-04-14 15:17:12,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1817#(< ~counter~0 20)} is VALID [2022-04-14 15:17:12,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 20)} is VALID [2022-04-14 15:17:12,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 19)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 19)} is VALID [2022-04-14 15:17:12,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {1827#(< ~counter~0 19)} is VALID [2022-04-14 15:17:12,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 19)} is VALID [2022-04-14 15:17:12,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#(< ~counter~0 18)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 18)} #82#return; {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-14 15:17:12,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-14 15:17:12,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-14 15:17:12,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#(< ~counter~0 18)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-14 15:17:12,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(< ~counter~0 18)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 18)} call #t~ret7 := main(); {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 18)} {1723#true} #102#return; {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 18)} assume true; {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1837#(< ~counter~0 18)} is VALID [2022-04-14 15:17:12,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:17:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:12,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491111951] [2022-04-14 15:17:12,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:12,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974193247] [2022-04-14 15:17:12,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974193247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:12,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:12,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 15:17:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593033193] [2022-04-14 15:17:12,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-14 15:17:12,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:12,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:12,055 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 15:17:12,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:17:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:17:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:17:12,057 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:13,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:16,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:20,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:26,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:31,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:33,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:37,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:49,231 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2022-04-14 15:17:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:17:49,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-14 15:17:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-04-14 15:17:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-04-14 15:17:49,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 172 transitions. [2022-04-14 15:17:49,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:49,417 INFO L225 Difference]: With dead ends: 139 [2022-04-14 15:17:49,417 INFO L226 Difference]: Without dead ends: 130 [2022-04-14 15:17:49,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:17:49,418 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 116 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:49,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 347 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 17.9s Time] [2022-04-14 15:17:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-14 15:17:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-04-14 15:17:49,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:49,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:17:49,476 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:17:49,476 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:17:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:49,481 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-04-14 15:17:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2022-04-14 15:17:49,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:49,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:49,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand 130 states. [2022-04-14 15:17:49,498 INFO L87 Difference]: Start difference. First operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand 130 states. [2022-04-14 15:17:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:49,505 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-04-14 15:17:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2022-04-14 15:17:49,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:49,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:49,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:49,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-14 15:17:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 166 transitions. [2022-04-14 15:17:49,512 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 166 transitions. Word has length 24 [2022-04-14 15:17:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:49,514 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 166 transitions. [2022-04-14 15:17:49,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2022-04-14 15:17:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:49,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:49,515 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:49,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 15:17:49,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:49,740 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-14 15:17:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:49,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983813759] [2022-04-14 15:17:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:17:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:49,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {2539#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-14 15:17:49,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:49,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-14 15:17:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:17:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:49,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-14 15:17:49,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-14 15:17:49,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:49,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-14 15:17:49,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2539#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:17:49,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2539#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-14 15:17:49,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:49,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-14 15:17:49,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:49,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:49,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:49,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:49,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:49,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 20);havoc #t~post5; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:49,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-14 15:17:49,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-14 15:17:49,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-14 15:17:49,988 INFO L272 TraceCheckUtils]: 20: Hoare triple {2536#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:17:49,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2538#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:17:49,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {2538#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2526#false} is VALID [2022-04-14 15:17:49,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-14 15:17:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:49,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:49,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983813759] [2022-04-14 15:17:49,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983813759] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:17:49,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597076532] [2022-04-14 15:17:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:49,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:49,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:49,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:17:49,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 15:17:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:50,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 15:17:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:50,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:50,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2022-04-14 15:17:50,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-14 15:17:50,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:50,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-14 15:17:50,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:50,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:50,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:50,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:50,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:50,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:50,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:50,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:50,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:50,383 INFO L272 TraceCheckUtils]: 20: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:50,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:50,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {2609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2526#false} is VALID [2022-04-14 15:17:50,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-14 15:17:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:50,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:50,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-14 15:17:50,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {2609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2526#false} is VALID [2022-04-14 15:17:50,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:50,664 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:50,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 20);havoc #t~post6; {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:50,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:50,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:50,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 20);havoc #t~post5; {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-14 15:17:50,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-14 15:17:50,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2635#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-14 15:17:50,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 20);havoc #t~post5; {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-14 15:17:50,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-14 15:17:50,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2645#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-14 15:17:50,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-14 15:17:50,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2525#true} is VALID [2022-04-14 15:17:50,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2022-04-14 15:17:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:50,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597076532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:50,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:17:50,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-14 15:17:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998480539] [2022-04-14 15:17:50,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:50,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-14 15:17:50,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:50,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:17:50,736 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 15:17:50,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:17:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:17:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:17:50,737 INFO L87 Difference]: Start difference. First operand 121 states and 166 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:17:57,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:59,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:01,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:03,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:05,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:07,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:10,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:14,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:16,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:23,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:29,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:33,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:40,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:41,015 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2022-04-14 15:18:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:18:41,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-14 15:18:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:18:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-04-14 15:18:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:18:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-04-14 15:18:41,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 136 transitions. [2022-04-14 15:18:41,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:41,441 INFO L225 Difference]: With dead ends: 183 [2022-04-14 15:18:41,441 INFO L226 Difference]: Without dead ends: 168 [2022-04-14 15:18:41,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-14 15:18:41,442 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 56 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 137 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:41,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 144 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 34.1s Time] [2022-04-14 15:18:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-14 15:18:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-04-14 15:18:41,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:41,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 160 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 97 states have internal predecessors, (112), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:18:41,531 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 160 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 97 states have internal predecessors, (112), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:18:41,531 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 160 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 97 states have internal predecessors, (112), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:18:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:41,538 INFO L93 Difference]: Finished difference Result 168 states and 233 transitions. [2022-04-14 15:18:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 233 transitions. [2022-04-14 15:18:41,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:41,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:41,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 97 states have internal predecessors, (112), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) Second operand 168 states. [2022-04-14 15:18:41,539 INFO L87 Difference]: Start difference. First operand has 160 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 97 states have internal predecessors, (112), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) Second operand 168 states. [2022-04-14 15:18:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:41,546 INFO L93 Difference]: Finished difference Result 168 states and 233 transitions. [2022-04-14 15:18:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 233 transitions. [2022-04-14 15:18:41,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:41,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:41,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:41,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 97 states have internal predecessors, (112), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:18:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2022-04-14 15:18:41,553 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 219 transitions. Word has length 24 [2022-04-14 15:18:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:41,553 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 219 transitions. [2022-04-14 15:18:41,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:18:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 219 transitions. [2022-04-14 15:18:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 15:18:41,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:41,554 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:18:41,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 15:18:41,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:41,768 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-14 15:18:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:41,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395561302] [2022-04-14 15:18:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:41,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:41,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606897193] [2022-04-14 15:18:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:41,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:41,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:41,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 15:18:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:41,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:18:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:41,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:42,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {3552#true} call ULTIMATE.init(); {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {3552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3552#true} {3552#true} #102#return; {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {3552#true} call #t~ret7 := main(); {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {3552#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {3552#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3552#true} is VALID [2022-04-14 15:18:42,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-14 15:18:42,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-14 15:18:42,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-14 15:18:42,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3552#true} {3552#true} #82#return; {3552#true} is VALID [2022-04-14 15:18:42,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {3552#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,092 INFO L272 TraceCheckUtils]: 17: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3552#true} is VALID [2022-04-14 15:18:42,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-14 15:18:42,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-14 15:18:42,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-14 15:18:42,093 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3552#true} {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,093 INFO L272 TraceCheckUtils]: 22: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3552#true} is VALID [2022-04-14 15:18:42,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-14 15:18:42,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-14 15:18:42,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-14 15:18:42,094 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3552#true} {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:42,095 INFO L272 TraceCheckUtils]: 27: Hoare triple {3590#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:42,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {3639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:42,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {3643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3553#false} is VALID [2022-04-14 15:18:42,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {3553#false} assume !false; {3553#false} is VALID [2022-04-14 15:18:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 15:18:42,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395561302] [2022-04-14 15:18:42,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606897193] [2022-04-14 15:18:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606897193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:42,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944033399] [2022-04-14 15:18:42,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-14 15:18:42,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:42,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:42,136 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 15:18:42,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:42,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:42,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:42,137 INFO L87 Difference]: Start difference. First operand 160 states and 219 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:49,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:49,643 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2022-04-14 15:18:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:18:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-14 15:18:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:18:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:18:49,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-14 15:18:49,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:49,726 INFO L225 Difference]: With dead ends: 171 [2022-04-14 15:18:49,726 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 15:18:49,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:18:49,727 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:49,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-14 15:18:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 15:18:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-14 15:18:49,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:49,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 82 states have internal predecessors, (95), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:49,786 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 82 states have internal predecessors, (95), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:49,787 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 82 states have internal predecessors, (95), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:49,792 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2022-04-14 15:18:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-04-14 15:18:49,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:49,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:49,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 82 states have internal predecessors, (95), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 135 states. [2022-04-14 15:18:49,794 INFO L87 Difference]: Start difference. First operand has 135 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 82 states have internal predecessors, (95), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 135 states. [2022-04-14 15:18:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:49,799 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2022-04-14 15:18:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-04-14 15:18:49,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:49,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:49,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:49,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 82 states have internal predecessors, (95), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 190 transitions. [2022-04-14 15:18:49,805 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 190 transitions. Word has length 31 [2022-04-14 15:18:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:49,805 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 190 transitions. [2022-04-14 15:18:49,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-04-14 15:18:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:18:49,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:49,806 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:18:49,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 15:18:50,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:50,011 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-14 15:18:50,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:50,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071617833] [2022-04-14 15:18:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:50,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:50,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:50,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398733092] [2022-04-14 15:18:50,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:50,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:50,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:50,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:50,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 15:18:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:50,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:18:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:50,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:50,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2022-04-14 15:18:50,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4372#true} is VALID [2022-04-14 15:18:50,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-14 15:18:50,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #102#return; {4372#true} is VALID [2022-04-14 15:18:50,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret7 := main(); {4372#true} is VALID [2022-04-14 15:18:50,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4372#true} is VALID [2022-04-14 15:18:50,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {4372#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4372#true} is VALID [2022-04-14 15:18:50,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-14 15:18:50,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-14 15:18:50,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-14 15:18:50,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4372#true} {4372#true} #82#return; {4372#true} is VALID [2022-04-14 15:18:50,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,290 INFO L272 TraceCheckUtils]: 20: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4372#true} is VALID [2022-04-14 15:18:50,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-14 15:18:50,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-14 15:18:50,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-14 15:18:50,291 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4372#true} {4410#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,291 INFO L272 TraceCheckUtils]: 25: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4372#true} is VALID [2022-04-14 15:18:50,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-14 15:18:50,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-14 15:18:50,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-14 15:18:50,291 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4372#true} {4410#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4410#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:50,292 INFO L272 TraceCheckUtils]: 30: Hoare triple {4410#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4468#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:50,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {4468#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4472#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:50,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {4472#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4373#false} is VALID [2022-04-14 15:18:50,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-14 15:18:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 15:18:50,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071617833] [2022-04-14 15:18:50,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398733092] [2022-04-14 15:18:50,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398733092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:50,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:50,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055128890] [2022-04-14 15:18:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:50,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-14 15:18:50,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:50,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:50,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:50,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:50,319 INFO L87 Difference]: Start difference. First operand 135 states and 190 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:53,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:55,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:59,327 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2022-04-14 15:18:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:18:59,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-14 15:18:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:18:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:18:59,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-14 15:18:59,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:59,423 INFO L225 Difference]: With dead ends: 161 [2022-04-14 15:18:59,423 INFO L226 Difference]: Without dead ends: 157 [2022-04-14 15:18:59,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:18:59,424 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:59,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-14 15:18:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-14 15:18:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2022-04-14 15:18:59,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:59,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 150 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 48 states have call successors, (48), 16 states have call predecessors, (48), 15 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:59,480 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 150 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 48 states have call successors, (48), 16 states have call predecessors, (48), 15 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:59,480 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 150 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 48 states have call successors, (48), 16 states have call predecessors, (48), 15 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:59,486 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2022-04-14 15:18:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2022-04-14 15:18:59,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:59,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:59,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 48 states have call successors, (48), 16 states have call predecessors, (48), 15 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 157 states. [2022-04-14 15:18:59,488 INFO L87 Difference]: Start difference. First operand has 150 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 48 states have call successors, (48), 16 states have call predecessors, (48), 15 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 157 states. [2022-04-14 15:18:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:59,493 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2022-04-14 15:18:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2022-04-14 15:18:59,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:59,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:59,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:59,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 48 states have call successors, (48), 16 states have call predecessors, (48), 15 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-14 15:18:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2022-04-14 15:18:59,498 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 34 [2022-04-14 15:18:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:59,498 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2022-04-14 15:18:59,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2022-04-14 15:18:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:18:59,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:59,499 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:18:59,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 15:18:59,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:59,708 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-14 15:18:59,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:59,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051399304] [2022-04-14 15:18:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:59,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:18:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:59,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {5261#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {5251#(<= ~counter~0 0)} assume true; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5251#(<= ~counter~0 0)} {5246#true} #102#return; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:18:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:59,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {5246#true} ~cond := #in~cond; {5246#true} is VALID [2022-04-14 15:18:59,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {5246#true} assume !(0 == ~cond); {5246#true} is VALID [2022-04-14 15:18:59,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {5246#true} assume true; {5246#true} is VALID [2022-04-14 15:18:59,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5246#true} {5251#(<= ~counter~0 0)} #82#return; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {5246#true} call ULTIMATE.init(); {5261#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:18:59,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {5261#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {5251#(<= ~counter~0 0)} assume true; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5251#(<= ~counter~0 0)} {5246#true} #102#return; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {5251#(<= ~counter~0 0)} call #t~ret7 := main(); {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {5251#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {5251#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5246#true} is VALID [2022-04-14 15:18:59,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {5246#true} ~cond := #in~cond; {5246#true} is VALID [2022-04-14 15:18:59,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {5246#true} assume !(0 == ~cond); {5246#true} is VALID [2022-04-14 15:18:59,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {5246#true} assume true; {5246#true} is VALID [2022-04-14 15:18:59,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5246#true} {5251#(<= ~counter~0 0)} #82#return; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {5251#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:59,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {5251#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5256#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:59,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {5256#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5256#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:59,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {5256#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5256#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:59,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {5256#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5257#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:59,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5257#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:59,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {5257#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5257#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:59,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {5257#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5258#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:59,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {5258#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5258#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:59,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {5258#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5258#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:59,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {5258#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5259#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:59,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {5259#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5259#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:59,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {5259#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5259#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:59,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {5259#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5260#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:18:59,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {5260#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {5247#false} is VALID [2022-04-14 15:18:59,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {5247#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5247#false} is VALID [2022-04-14 15:18:59,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {5247#false} assume !!(#t~post6 < 20);havoc #t~post6; {5247#false} is VALID [2022-04-14 15:18:59,870 INFO L272 TraceCheckUtils]: 28: Hoare triple {5247#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5247#false} is VALID [2022-04-14 15:18:59,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {5247#false} ~cond := #in~cond; {5247#false} is VALID [2022-04-14 15:18:59,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {5247#false} assume 0 == ~cond; {5247#false} is VALID [2022-04-14 15:18:59,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {5247#false} assume !false; {5247#false} is VALID [2022-04-14 15:18:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:18:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:59,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051399304] [2022-04-14 15:18:59,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051399304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:18:59,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353470797] [2022-04-14 15:18:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:59,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:59,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:59,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:59,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 15:18:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:59,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:18:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:59,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:19:00,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {5246#true} call ULTIMATE.init(); {5246#true} is VALID [2022-04-14 15:19:00,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {5246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {5251#(<= ~counter~0 0)} assume true; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5251#(<= ~counter~0 0)} {5246#true} #102#return; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {5251#(<= ~counter~0 0)} call #t~ret7 := main(); {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {5251#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {5251#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {5251#(<= ~counter~0 0)} ~cond := #in~cond; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {5251#(<= ~counter~0 0)} assume !(0 == ~cond); {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {5251#(<= ~counter~0 0)} assume true; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5251#(<= ~counter~0 0)} {5251#(<= ~counter~0 0)} #82#return; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {5251#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5251#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:00,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {5251#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5256#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:00,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {5256#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5256#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:00,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {5256#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5256#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:00,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {5256#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5257#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:00,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5257#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:00,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {5257#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5257#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:00,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {5257#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5258#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:00,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {5258#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5258#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:00,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {5258#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5258#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:00,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {5258#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5259#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:00,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {5259#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5259#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:00,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {5259#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5259#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:00,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {5259#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5260#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:19:00,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {5260#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {5247#false} is VALID [2022-04-14 15:19:00,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {5247#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5247#false} is VALID [2022-04-14 15:19:00,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {5247#false} assume !!(#t~post6 < 20);havoc #t~post6; {5247#false} is VALID [2022-04-14 15:19:00,199 INFO L272 TraceCheckUtils]: 28: Hoare triple {5247#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5247#false} is VALID [2022-04-14 15:19:00,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {5247#false} ~cond := #in~cond; {5247#false} is VALID [2022-04-14 15:19:00,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {5247#false} assume 0 == ~cond; {5247#false} is VALID [2022-04-14 15:19:00,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {5247#false} assume !false; {5247#false} is VALID [2022-04-14 15:19:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:19:00,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:19:00,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {5247#false} assume !false; {5247#false} is VALID [2022-04-14 15:19:00,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {5247#false} assume 0 == ~cond; {5247#false} is VALID [2022-04-14 15:19:00,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {5247#false} ~cond := #in~cond; {5247#false} is VALID [2022-04-14 15:19:00,475 INFO L272 TraceCheckUtils]: 28: Hoare triple {5247#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5247#false} is VALID [2022-04-14 15:19:00,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {5247#false} assume !!(#t~post6 < 20);havoc #t~post6; {5247#false} is VALID [2022-04-14 15:19:00,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {5247#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5247#false} is VALID [2022-04-14 15:19:00,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {5376#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5247#false} is VALID [2022-04-14 15:19:00,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {5380#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5376#(< |main_#t~post5| 20)} is VALID [2022-04-14 15:19:00,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {5380#(< ~counter~0 20)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5380#(< ~counter~0 20)} is VALID [2022-04-14 15:19:00,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {5380#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5380#(< ~counter~0 20)} is VALID [2022-04-14 15:19:00,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {5390#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5380#(< ~counter~0 20)} is VALID [2022-04-14 15:19:00,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {5390#(< ~counter~0 19)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5390#(< ~counter~0 19)} is VALID [2022-04-14 15:19:00,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {5390#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5390#(< ~counter~0 19)} is VALID [2022-04-14 15:19:00,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {5400#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5390#(< ~counter~0 19)} is VALID [2022-04-14 15:19:00,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {5400#(< ~counter~0 18)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5400#(< ~counter~0 18)} is VALID [2022-04-14 15:19:00,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {5400#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5400#(< ~counter~0 18)} is VALID [2022-04-14 15:19:00,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {5410#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5400#(< ~counter~0 18)} is VALID [2022-04-14 15:19:00,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {5410#(< ~counter~0 17)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5410#(< ~counter~0 17)} is VALID [2022-04-14 15:19:00,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {5410#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5410#(< ~counter~0 17)} is VALID [2022-04-14 15:19:00,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {5420#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5410#(< ~counter~0 17)} is VALID [2022-04-14 15:19:00,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {5420#(< ~counter~0 16)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5246#true} {5420#(< ~counter~0 16)} #82#return; {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {5246#true} assume true; {5246#true} is VALID [2022-04-14 15:19:00,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {5246#true} assume !(0 == ~cond); {5246#true} is VALID [2022-04-14 15:19:00,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {5246#true} ~cond := #in~cond; {5246#true} is VALID [2022-04-14 15:19:00,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {5420#(< ~counter~0 16)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5246#true} is VALID [2022-04-14 15:19:00,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {5420#(< ~counter~0 16)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {5420#(< ~counter~0 16)} call #t~ret7 := main(); {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5420#(< ~counter~0 16)} {5246#true} #102#return; {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {5420#(< ~counter~0 16)} assume true; {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {5246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5420#(< ~counter~0 16)} is VALID [2022-04-14 15:19:00,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {5246#true} call ULTIMATE.init(); {5246#true} is VALID [2022-04-14 15:19:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:19:00,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353470797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:19:00,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:19:00,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-14 15:19:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600732222] [2022-04-14 15:19:00,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:19:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-14 15:19:00,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:00,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:19:00,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:19:00,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:19:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:19:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:19:00,529 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:19:06,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:19:09,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:19:12,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:16,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:20,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:19:22,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:25,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:27,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:29,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:19:31,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:37,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:40,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:45,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:47,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:49,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:51,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:53,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:59,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:04,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:06,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:08,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:12,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:19,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:21,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:22,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:24,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:25,006 INFO L93 Difference]: Finished difference Result 364 states and 465 transitions. [2022-04-14 15:20:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 15:20:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-14 15:20:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:20:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:20:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 269 transitions. [2022-04-14 15:20:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:20:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 269 transitions. [2022-04-14 15:20:25,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 269 transitions. [2022-04-14 15:20:25,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:20:25,283 INFO L225 Difference]: With dead ends: 364 [2022-04-14 15:20:25,283 INFO L226 Difference]: Without dead ends: 324 [2022-04-14 15:20:25,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-14 15:20:25,285 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 242 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 195 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:20:25,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 181 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 409 Invalid, 23 Unknown, 0 Unchecked, 68.1s Time] [2022-04-14 15:20:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-04-14 15:20:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 287. [2022-04-14 15:20:25,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:20:25,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 287 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 177 states have internal predecessors, (199), 88 states have call successors, (88), 31 states have call predecessors, (88), 30 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:20:25,433 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 287 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 177 states have internal predecessors, (199), 88 states have call successors, (88), 31 states have call predecessors, (88), 30 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:20:25,434 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 287 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 177 states have internal predecessors, (199), 88 states have call successors, (88), 31 states have call predecessors, (88), 30 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:20:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:25,443 INFO L93 Difference]: Finished difference Result 324 states and 406 transitions. [2022-04-14 15:20:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 406 transitions. [2022-04-14 15:20:25,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:25,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:25,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 177 states have internal predecessors, (199), 88 states have call successors, (88), 31 states have call predecessors, (88), 30 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 324 states. [2022-04-14 15:20:25,445 INFO L87 Difference]: Start difference. First operand has 287 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 177 states have internal predecessors, (199), 88 states have call successors, (88), 31 states have call predecessors, (88), 30 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 324 states. [2022-04-14 15:20:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:25,454 INFO L93 Difference]: Finished difference Result 324 states and 406 transitions. [2022-04-14 15:20:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 406 transitions. [2022-04-14 15:20:25,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:25,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:25,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:20:25,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:20:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 177 states have internal predecessors, (199), 88 states have call successors, (88), 31 states have call predecessors, (88), 30 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:20:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 369 transitions. [2022-04-14 15:20:25,465 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 369 transitions. Word has length 32 [2022-04-14 15:20:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:20:25,465 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 369 transitions. [2022-04-14 15:20:25,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:20:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 369 transitions. [2022-04-14 15:20:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:20:25,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:20:25,466 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:20:25,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 15:20:25,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 15:20:25,694 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:20:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:20:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-14 15:20:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:20:25,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264506614] [2022-04-14 15:20:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:20:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:20:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:25,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {7104#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {7088#(<= ~counter~0 0)} assume true; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7088#(<= ~counter~0 0)} {7083#true} #102#return; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:20:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:25,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {7083#true} ~cond := #in~cond; {7083#true} is VALID [2022-04-14 15:20:25,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {7083#true} assume !(0 == ~cond); {7083#true} is VALID [2022-04-14 15:20:25,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {7083#true} assume true; {7083#true} is VALID [2022-04-14 15:20:25,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7083#true} {7088#(<= ~counter~0 0)} #82#return; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {7083#true} call ULTIMATE.init(); {7104#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:20:25,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {7104#(and (= ~counter~0 |old(~counter~0)|) (= |#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {7088#(<= ~counter~0 0)} assume true; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7088#(<= ~counter~0 0)} {7083#true} #102#return; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {7088#(<= ~counter~0 0)} call #t~ret7 := main(); {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {7088#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,915 INFO L272 TraceCheckUtils]: 6: Hoare triple {7088#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7083#true} is VALID [2022-04-14 15:20:25,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {7083#true} ~cond := #in~cond; {7083#true} is VALID [2022-04-14 15:20:25,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {7083#true} assume !(0 == ~cond); {7083#true} is VALID [2022-04-14 15:20:25,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {7083#true} assume true; {7083#true} is VALID [2022-04-14 15:20:25,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7083#true} {7088#(<= ~counter~0 0)} #82#return; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {7088#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7088#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:25,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {7088#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7093#(<= ~counter~0 1)} is VALID [2022-04-14 15:20:25,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {7093#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7093#(<= ~counter~0 1)} is VALID [2022-04-14 15:20:25,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {7093#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7093#(<= ~counter~0 1)} is VALID [2022-04-14 15:20:25,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {7093#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7094#(<= ~counter~0 2)} is VALID [2022-04-14 15:20:25,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {7094#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7094#(<= ~counter~0 2)} is VALID [2022-04-14 15:20:25,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {7094#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7094#(<= ~counter~0 2)} is VALID [2022-04-14 15:20:25,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {7094#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7095#(<= ~counter~0 3)} is VALID [2022-04-14 15:20:25,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {7095#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7095#(<= ~counter~0 3)} is VALID [2022-04-14 15:20:25,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {7095#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7095#(<= ~counter~0 3)} is VALID [2022-04-14 15:20:25,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {7095#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7096#(<= ~counter~0 4)} is VALID [2022-04-14 15:20:25,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {7096#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7096#(<= ~counter~0 4)} is VALID [2022-04-14 15:20:25,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {7096#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7096#(<= ~counter~0 4)} is VALID [2022-04-14 15:20:25,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {7096#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7097#(<= ~counter~0 5)} is VALID [2022-04-14 15:20:25,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {7097#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7097#(<= ~counter~0 5)} is VALID [2022-04-14 15:20:25,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {7097#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7097#(<= ~counter~0 5)} is VALID [2022-04-14 15:20:25,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {7097#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7098#(<= ~counter~0 6)} is VALID [2022-04-14 15:20:25,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {7098#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7098#(<= ~counter~0 6)} is VALID [2022-04-14 15:20:25,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {7098#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7098#(<= ~counter~0 6)} is VALID [2022-04-14 15:20:25,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {7098#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7099#(<= ~counter~0 7)} is VALID [2022-04-14 15:20:25,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {7099#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {7099#(<= ~counter~0 7)} is VALID [2022-04-14 15:20:25,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {7099#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7099#(<= ~counter~0 7)} is VALID [2022-04-14 15:20:25,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {7099#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7100#(<= ~counter~0 8)} is VALID [2022-04-14 15:20:25,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {7100#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {7100#(<= ~counter~0 8)} is VALID [2022-04-14 15:20:25,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {7100#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7100#(<= ~counter~0 8)} is VALID [2022-04-14 15:20:25,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {7100#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7101#(<= ~counter~0 9)} is VALID [2022-04-14 15:20:25,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {7101#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {7101#(<= ~counter~0 9)} is VALID [2022-04-14 15:20:25,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {7101#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7101#(<= ~counter~0 9)} is VALID [2022-04-14 15:20:25,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {7101#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7102#(<= ~counter~0 10)} is VALID [2022-04-14 15:20:25,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {7102#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {7102#(<= ~counter~0 10)} is VALID [2022-04-14 15:20:25,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {7102#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7102#(<= ~counter~0 10)} is VALID [2022-04-14 15:20:25,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {7102#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7103#(<= |main_#t~post5| 10)} is VALID [2022-04-14 15:20:25,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {7103#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {7084#false} is VALID [2022-04-14 15:20:25,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {7084#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7084#false} is VALID [2022-04-14 15:20:25,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {7084#false} assume !!(#t~post6 < 20);havoc #t~post6; {7084#false} is VALID [2022-04-14 15:20:25,931 INFO L272 TraceCheckUtils]: 46: Hoare triple {7084#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7084#false} is VALID [2022-04-14 15:20:25,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {7084#false} ~cond := #in~cond; {7084#false} is VALID [2022-04-14 15:20:25,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {7084#false} assume 0 == ~cond; {7084#false} is VALID [2022-04-14 15:20:25,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {7084#false} assume !false; {7084#false} is VALID [2022-04-14 15:20:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:20:25,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:20:25,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264506614] [2022-04-14 15:20:25,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264506614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:20:25,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645208685] [2022-04-14 15:20:25,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:20:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:20:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:20:25,936 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:20:25,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 15:20:25,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-14 15:20:25,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:20:25,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-14 15:20:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:25,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:20:26,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {7083#true} call ULTIMATE.init(); {7083#true} is VALID [2022-04-14 15:20:26,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {7083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7083#true} is VALID [2022-04-14 15:20:26,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {7083#true} assume true; {7083#true} is VALID [2022-04-14 15:20:26,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7083#true} {7083#true} #102#return; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {7083#true} call #t~ret7 := main(); {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {7083#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {7083#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {7083#true} ~cond := #in~cond; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {7083#true} assume !(0 == ~cond); {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {7083#true} assume true; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7083#true} {7083#true} #82#return; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {7083#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {7083#true} assume !!(#t~post5 < 20);havoc #t~post5; {7083#true} is VALID [2022-04-14 15:20:26,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {7083#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7083#true} is VALID [2022-04-14 15:20:26,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {7083#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7234#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-14 15:20:26,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {7234#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 20);havoc #t~post5; {7238#(<= 21 ~counter~0)} is VALID [2022-04-14 15:20:26,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {7238#(<= 21 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7242#(<= 21 |main_#t~post6|)} is VALID [2022-04-14 15:20:26,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {7242#(<= 21 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {7084#false} is VALID [2022-04-14 15:20:26,146 INFO L272 TraceCheckUtils]: 46: Hoare triple {7084#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7084#false} is VALID [2022-04-14 15:20:26,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {7084#false} ~cond := #in~cond; {7084#false} is VALID [2022-04-14 15:20:26,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {7084#false} assume 0 == ~cond; {7084#false} is VALID [2022-04-14 15:20:26,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {7084#false} assume !false; {7084#false} is VALID [2022-04-14 15:20:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-14 15:20:26,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:20:26,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645208685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:20:26,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:20:26,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-14 15:20:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206094363] [2022-04-14 15:20:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:20:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-14 15:20:26,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:20:26,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:20:26,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:20:26,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:20:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:20:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:20:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:20:26,167 INFO L87 Difference]: Start difference. First operand 287 states and 369 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:20:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:39,196 INFO L93 Difference]: Finished difference Result 324 states and 418 transitions. [2022-04-14 15:20:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:20:39,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-14 15:20:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:20:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:20:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 15:20:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:20:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 15:20:39,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-14 15:20:39,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:20:39,287 INFO L225 Difference]: With dead ends: 324 [2022-04-14 15:20:39,287 INFO L226 Difference]: Without dead ends: 284 [2022-04-14 15:20:39,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-14 15:20:39,288 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:20:39,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:20:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-14 15:20:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2022-04-14 15:20:39,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:20:39,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 194 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 120 states have internal predecessors, (132), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-14 15:20:39,429 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 194 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 120 states have internal predecessors, (132), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-14 15:20:39,430 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 194 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 120 states have internal predecessors, (132), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-14 15:20:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:39,437 INFO L93 Difference]: Finished difference Result 284 states and 364 transitions. [2022-04-14 15:20:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2022-04-14 15:20:39,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:39,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:39,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 120 states have internal predecessors, (132), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 284 states. [2022-04-14 15:20:39,440 INFO L87 Difference]: Start difference. First operand has 194 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 120 states have internal predecessors, (132), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 284 states. [2022-04-14 15:20:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:39,448 INFO L93 Difference]: Finished difference Result 284 states and 364 transitions. [2022-04-14 15:20:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 364 transitions. [2022-04-14 15:20:39,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:39,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:39,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:20:39,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:20:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 120 states have internal predecessors, (132), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-14 15:20:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2022-04-14 15:20:39,454 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 50 [2022-04-14 15:20:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:20:39,455 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2022-04-14 15:20:39,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:20:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2022-04-14 15:20:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 15:20:39,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:20:39,456 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:20:39,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 15:20:39,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:20:39,677 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:20:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:20:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-14 15:20:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:20:39,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836513287] [2022-04-14 15:20:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:20:39,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:20:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066500412] [2022-04-14 15:20:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:39,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:20:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:20:39,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:20:39,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process