/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/hard-u_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:37:13,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:37:13,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:37:13,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:37:13,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:37:13,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:37:13,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:37:13,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:37:13,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:37:13,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:37:13,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:37:13,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:37:13,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:37:13,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:37:13,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:37:13,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:37:13,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:37:13,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:37:13,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:37:13,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:37:13,412 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:37:13,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:37:13,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:37:13,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:37:13,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:37:13,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:37:13,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:37:13,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:37:13,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:37:13,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:37:13,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:37:13,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:37:13,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:37:13,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:37:13,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:37:13,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:37:13,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:37:13,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:37:13,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:37:13,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:37:13,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:37:13,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:37:13,423 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-27 13:37:13,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:37:13,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:37:13,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:37:13,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:37:13,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:37:13,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:37:13,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:37:13,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:37:13,438 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:37:13,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:37:13,438 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:37:13,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:37:13,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:37:13,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:37:13,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:37:13,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:37:13,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:37:13,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:37:13,440 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-27 13:37:13,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:37:13,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:37:13,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:37:13,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:37:13,618 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:37:13,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c [2022-04-27 13:37:13,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263a6e954/5b6eeae1b3c448a38740d0b20cce5c6b/FLAGe7f7945f7 [2022-04-27 13:37:13,983 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:37:13,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c [2022-04-27 13:37:13,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263a6e954/5b6eeae1b3c448a38740d0b20cce5c6b/FLAGe7f7945f7 [2022-04-27 13:37:13,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263a6e954/5b6eeae1b3c448a38740d0b20cce5c6b [2022-04-27 13:37:14,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:37:14,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:37:14,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:37:14,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:37:14,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:37:14,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e59aca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14, skipping insertion in model container [2022-04-27 13:37:14,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:37:14,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:37:14,141 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/hard-u_valuebound100.c[537,550] [2022-04-27 13:37:14,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:37:14,176 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:37:14,185 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/hard-u_valuebound100.c[537,550] [2022-04-27 13:37:14,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:37:14,199 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:37:14,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14 WrapperNode [2022-04-27 13:37:14,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:37:14,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:37:14,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:37:14,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:37:14,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:37:14,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:37:14,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:37:14,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:37:14,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (1/1) ... [2022-04-27 13:37:14,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:37:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:14,275 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-27 13:37:14,283 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-27 13:37:14,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:37:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:37:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:37:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:37:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:37:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:37:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:37:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:37:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:37:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:37:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:37:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:37:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:37:14,351 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:37:14,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:37:14,483 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:37:14,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:37:14,488 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:37:14,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:37:14 BoogieIcfgContainer [2022-04-27 13:37:14,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:37:14,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:37:14,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:37:14,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:37:14,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:37:14" (1/3) ... [2022-04-27 13:37:14,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b673c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:37:14, skipping insertion in model container [2022-04-27 13:37:14,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:37:14" (2/3) ... [2022-04-27 13:37:14,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b673c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:37:14, skipping insertion in model container [2022-04-27 13:37:14,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:37:14" (3/3) ... [2022-04-27 13:37:14,514 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound100.c [2022-04-27 13:37:14,523 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:37:14,524 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:37:14,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:37:14,594 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19b3b76b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1bd8954d [2022-04-27 13:37:14,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:37:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 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-27 13:37:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:37:14,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:14,608 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:37:14,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 1 times [2022-04-27 13:37:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:14,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561364374] [2022-04-27 13:37:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:37:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:14,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 13:37:14,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 13:37:14,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-27 13:37:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:37:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:14,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:37:14,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:37:14,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:37:14,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 13:37:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:37:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:14,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:37:14,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:37:14,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:37:14,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 13:37:14,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:37:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:14,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:37:14,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:37:14,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:37:14,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-27 13:37:14,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:37:14,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 13:37:14,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 13:37:14,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-27 13:37:14,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret6 := main(); {41#true} is VALID [2022-04-27 13:37:14,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-27 13:37:14,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {41#true} is VALID [2022-04-27 13:37:14,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:37:14,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:37:14,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:37:14,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 13:37:14,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~B~0 := #t~nondet5;havoc #t~nondet5; {42#false} is VALID [2022-04-27 13:37:14,825 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {41#true} is VALID [2022-04-27 13:37:14,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:37:14,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:37:14,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:37:14,827 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 13:37:14,827 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-27 13:37:14,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:37:14,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:37:14,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:37:14,828 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-27 13:37:14,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {42#false} is VALID [2022-04-27 13:37:14,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 13:37:14,829 INFO L272 TraceCheckUtils]: 24: Hoare triple {42#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-27 13:37:14,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 13:37:14,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 13:37:14,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 13:37:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:14,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561364374] [2022-04-27 13:37:14,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561364374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:37:14,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:37:14,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:37:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673965741] [2022-04-27 13:37:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:14,836 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:37:14,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:14,840 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:37:14,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:14,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:37:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:37:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:37:14,902 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:37:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:15,098 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-04-27 13:37:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:37:15,099 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:37:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:15,100 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:37:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 13:37:15,114 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:37:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 13:37:15,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-27 13:37:15,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:15,249 INFO L225 Difference]: With dead ends: 69 [2022-04-27 13:37:15,249 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:37:15,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-27 13:37:15,257 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:15,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:37:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:37:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 13:37:15,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:15,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-27 13:37:15,285 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-27 13:37:15,286 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-27 13:37:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:15,291 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:37:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:37:15,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:15,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:15,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 33 states. [2022-04-27 13:37:15,293 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 33 states. [2022-04-27 13:37:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:15,295 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:37:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:37:15,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:15,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:15,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:15,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-27 13:37:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 13:37:15,302 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-27 13:37:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:15,302 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 13:37:15,303 INFO L496 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:37:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:37:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:37:15,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:15,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:37:15,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:37:15,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 1 times [2022-04-27 13:37:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:15,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363337061] [2022-04-27 13:37:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:37:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:15,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-04-27 13:37:15,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #101#return; {275#true} is VALID [2022-04-27 13:37:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:37:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:15,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:37:15,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:37:15,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #81#return; {275#true} is VALID [2022-04-27 13:37:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:37:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:15,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:37:15,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:37:15,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 13:37:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:37:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:15,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:37:15,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:37:15,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #85#return; {275#true} is VALID [2022-04-27 13:37:15,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:37:15,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-04-27 13:37:15,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #101#return; {275#true} is VALID [2022-04-27 13:37:15,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret6 := main(); {275#true} is VALID [2022-04-27 13:37:15,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {275#true} is VALID [2022-04-27 13:37:15,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {275#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {275#true} is VALID [2022-04-27 13:37:15,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:37:15,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:37:15,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {275#true} {275#true} #81#return; {275#true} is VALID [2022-04-27 13:37:15,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {275#true} is VALID [2022-04-27 13:37:15,449 INFO L272 TraceCheckUtils]: 12: Hoare triple {275#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {275#true} is VALID [2022-04-27 13:37:15,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:37:15,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:37:15,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,449 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 13:37:15,449 INFO L272 TraceCheckUtils]: 17: Hoare triple {275#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {275#true} is VALID [2022-04-27 13:37:15,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:37:15,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:37:15,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:37:15,450 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {275#true} {275#true} #85#return; {275#true} is VALID [2022-04-27 13:37:15,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {275#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {292#(= main_~q~0 0)} is VALID [2022-04-27 13:37:15,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {292#(= main_~q~0 0)} assume !false; {292#(= main_~q~0 0)} is VALID [2022-04-27 13:37:15,456 INFO L272 TraceCheckUtils]: 24: Hoare triple {292#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:15,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {293#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:37:15,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {276#false} is VALID [2022-04-27 13:37:15,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 13:37:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363337061] [2022-04-27 13:37:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363337061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:37:15,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:37:15,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:37:15,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140208799] [2022-04-27 13:37:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 13:37:15,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:15,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:37:15,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:15,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:37:15,479 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:37:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:15,863 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:37:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:37:15,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 13:37:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:37:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:37:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:37:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:37:15,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 13:37:15,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:15,943 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:37:15,943 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:37:15,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:37:15,950 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:15,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:37:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:37:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-27 13:37:15,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:15,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:15,965 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:15,966 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:15,970 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:37:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:37:15,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:15,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:15,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-27 13:37:15,972 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-27 13:37:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:15,974 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:37:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:37:15,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:15,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:15,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:15,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 13:37:15,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-27 13:37:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:15,976 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 13:37:15,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:37:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 13:37:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:37:15,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:15,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:37:15,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:37:15,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 1 times [2022-04-27 13:37:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:15,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834741852] [2022-04-27 13:37:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:37:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-04-27 13:37:16,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {517#true} {517#true} #101#return; {517#true} is VALID [2022-04-27 13:37:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:37:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #81#return; {517#true} is VALID [2022-04-27 13:37:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:37:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #83#return; {517#true} is VALID [2022-04-27 13:37:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:37:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #85#return; {517#true} is VALID [2022-04-27 13:37:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 13:37:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {534#(= main_~A~0 main_~r~0)} #87#return; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:37:16,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:37:16,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-04-27 13:37:16,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #101#return; {517#true} is VALID [2022-04-27 13:37:16,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret6 := main(); {517#true} is VALID [2022-04-27 13:37:16,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {517#true} is VALID [2022-04-27 13:37:16,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {517#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {517#true} {517#true} #81#return; {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {517#true} is VALID [2022-04-27 13:37:16,139 INFO L272 TraceCheckUtils]: 12: Hoare triple {517#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,140 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {517#true} {517#true} #83#return; {517#true} is VALID [2022-04-27 13:37:16,140 INFO L272 TraceCheckUtils]: 17: Hoare triple {517#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {517#true} is VALID [2022-04-27 13:37:16,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,140 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {517#true} {517#true} #85#return; {517#true} is VALID [2022-04-27 13:37:16,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {517#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:37:16,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {534#(= main_~A~0 main_~r~0)} assume !false; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:37:16,141 INFO L272 TraceCheckUtils]: 24: Hoare triple {534#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {517#true} is VALID [2022-04-27 13:37:16,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:37:16,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:37:16,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:37:16,141 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {517#true} {534#(= main_~A~0 main_~r~0)} #87#return; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:37:16,142 INFO L272 TraceCheckUtils]: 29: Hoare triple {534#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {539#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:16,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {539#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {540#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:37:16,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {540#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {518#false} is VALID [2022-04-27 13:37:16,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-04-27 13:37:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:16,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:16,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834741852] [2022-04-27 13:37:16,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834741852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:37:16,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:37:16,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:37:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021224538] [2022-04-27 13:37:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:37:16,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:16,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:16,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:16,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:16,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:37:16,159 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:16,468 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-27 13:37:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:37:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:37:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:37:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:37:16,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 13:37:16,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:16,524 INFO L225 Difference]: With dead ends: 50 [2022-04-27 13:37:16,524 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 13:37:16,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:37:16,525 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:16,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 48 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:37:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 13:37:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-27 13:37:16,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:16,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:16,530 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:16,530 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:16,532 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:37:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 13:37:16,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:16,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:16,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-27 13:37:16,533 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-27 13:37:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:16,535 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:37:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 13:37:16,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:16,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:16,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:16,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:37:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-27 13:37:16,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-27 13:37:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:16,537 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-27 13:37:16,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 13:37:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:37:16,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:16,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-27 13:37:16,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:37:16,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 1 times [2022-04-27 13:37:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:16,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922240021] [2022-04-27 13:37:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:16,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:16,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869127105] [2022-04-27 13:37:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:16,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:16,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:16,550 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-27 13:37:16,557 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-27 13:37:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:37:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:16,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:16,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-27 13:37:16,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-27 13:37:16,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:37:16,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #101#return; {781#true} is VALID [2022-04-27 13:37:16,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-27 13:37:16,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {781#true} is VALID [2022-04-27 13:37:16,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {781#true} {781#true} #81#return; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L272 TraceCheckUtils]: 12: Hoare triple {781#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {781#true} {781#true} #83#return; {781#true} is VALID [2022-04-27 13:37:16,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {781#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {781#true} is VALID [2022-04-27 13:37:16,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:37:16,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:37:16,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:37:16,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {781#true} {781#true} #85#return; {781#true} is VALID [2022-04-27 13:37:16,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:16,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:16,765 INFO L272 TraceCheckUtils]: 24: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {781#true} is VALID [2022-04-27 13:37:16,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:37:16,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:37:16,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:37:16,765 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {781#true} {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:16,766 INFO L272 TraceCheckUtils]: 29: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {781#true} is VALID [2022-04-27 13:37:16,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:37:16,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:37:16,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:37:16,766 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {781#true} {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:16,767 INFO L272 TraceCheckUtils]: 34: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:16,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:16,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-27 13:37:16,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-27 13:37:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:37:16,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:37:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:16,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922240021] [2022-04-27 13:37:16,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:16,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869127105] [2022-04-27 13:37:16,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869127105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:37:16,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:37:16,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:37:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116292438] [2022-04-27 13:37:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:16,769 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-27 13:37:16,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:16,769 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:37:16,797 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-27 13:37:16,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:37:16,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:16,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:37:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:37:16,798 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:37:18,914 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-27 13:37:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:19,120 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-27 13:37:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:19,121 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-27 13:37:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:19,121 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:37:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:37:19,122 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:37:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:37:19,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 13:37:19,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:19,180 INFO L225 Difference]: With dead ends: 58 [2022-04-27 13:37:19,180 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 13:37:19,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-27 13:37:19,181 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:19,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 13:37:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 13:37:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 13:37:19,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:19,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:37:19,187 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:37:19,187 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:37:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:19,190 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 13:37:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:37:19,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:19,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:19,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-27 13:37:19,191 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-27 13:37:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:19,193 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 13:37:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:37:19,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:19,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:19,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:19,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:37:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-27 13:37:19,195 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-27 13:37:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:19,195 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-27 13:37:19,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:37:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:37:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 13:37:19,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:19,196 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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-27 13:37:19,215 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-27 13:37:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:19,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 1 times [2022-04-27 13:37:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556554094] [2022-04-27 13:37:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:19,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:19,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866176873] [2022-04-27 13:37:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:19,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:19,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:19,440 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-27 13:37:19,451 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-27 13:37:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:37:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:19,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:20,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #101#return; {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret6 := main(); {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:20,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:20,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:20,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:20,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} #81#return; {1179#true} is VALID [2022-04-27 13:37:20,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1179#true} is VALID [2022-04-27 13:37:20,707 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:20,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#true} ~cond := #in~cond; {1223#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:37:20,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1227#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:20,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1227#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:20,714 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1227#(not (= |assume_abort_if_not_#in~cond| 0))} {1179#true} #83#return; {1234#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 13:37:20,714 INFO L272 TraceCheckUtils]: 17: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:20,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:20,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:20,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:20,714 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1234#(<= (mod main_~B~0 4294967296) 100)} #85#return; {1234#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 13:37:20,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 100)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:20,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} assume !false; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:20,715 INFO L272 TraceCheckUtils]: 24: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:20,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:20,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:20,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:20,716 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} #87#return; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:20,716 INFO L272 TraceCheckUtils]: 29: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:20,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:20,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:20,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:20,717 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} #89#return; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:20,717 INFO L272 TraceCheckUtils]: 34: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:20,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:20,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:20,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:20,718 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} #91#return; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:20,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:20,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} assume !false; {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:20,720 INFO L272 TraceCheckUtils]: 41: Hoare triple {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 100))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:20,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:20,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1180#false} is VALID [2022-04-27 13:37:20,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-27 13:37:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 13:37:20,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:21,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-27 13:37:21,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1180#false} is VALID [2022-04-27 13:37:21,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:21,134 INFO L272 TraceCheckUtils]: 41: Hoare triple {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:21,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} assume !false; {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:37:21,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:37:21,136 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:21,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:21,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:21,136 INFO L272 TraceCheckUtils]: 34: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:21,137 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:21,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:21,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:21,137 INFO L272 TraceCheckUtils]: 29: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:21,138 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:21,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:21,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:21,139 INFO L272 TraceCheckUtils]: 24: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:21,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:21,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:21,144 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1179#true} #85#return; {1179#true} is VALID [2022-04-27 13:37:21,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:21,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:21,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:21,144 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1179#true} {1179#true} #83#return; {1179#true} is VALID [2022-04-27 13:37:21,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} #81#return; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret6 := main(); {1179#true} is VALID [2022-04-27 13:37:21,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #101#return; {1179#true} is VALID [2022-04-27 13:37:21,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:21,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1179#true} is VALID [2022-04-27 13:37:21,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-27 13:37:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:37:21,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:21,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556554094] [2022-04-27 13:37:21,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:21,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866176873] [2022-04-27 13:37:21,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866176873] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:37:21,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:37:21,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:37:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45109670] [2022-04-27 13:37:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:21,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-27 13:37:21,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:21,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:37:21,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:21,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:21,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:21,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:37:21,189 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:37:23,472 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-27 13:37:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:24,029 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-27 13:37:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-27 13:37:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:37:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 13:37:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:37:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 13:37:24,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 13:37:24,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:24,084 INFO L225 Difference]: With dead ends: 68 [2022-04-27 13:37:24,084 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 13:37:24,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:24,085 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:24,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:37:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 13:37:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 13:37:24,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:24,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:37:24,092 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:37:24,092 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:37:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:24,094 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 13:37:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 13:37:24,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:24,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:24,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 13:37:24,095 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 13:37:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:24,097 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 13:37:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 13:37:24,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:24,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:24,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:24,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:37:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-27 13:37:24,100 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-27 13:37:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:24,100 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-27 13:37:24,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:37:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-27 13:37:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:37:24,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:24,101 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:37:24,119 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-27 13:37:24,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:24,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 1 times [2022-04-27 13:37:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:24,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241064897] [2022-04-27 13:37:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:24,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:24,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825693530] [2022-04-27 13:37:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:24,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:24,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:24,332 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-27 13:37:24,333 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-27 13:37:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:24,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 13:37:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:24,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:26,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #101#return; {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret6 := main(); {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#true} #81#return; {1787#true} is VALID [2022-04-27 13:37:26,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1787#true} is VALID [2022-04-27 13:37:26,018 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#true} ~cond := #in~cond; {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:37:26,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:26,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:26,019 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} {1787#true} #83#return; {1842#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 13:37:26,019 INFO L272 TraceCheckUtils]: 17: Hoare triple {1842#(<= (mod main_~B~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#true} ~cond := #in~cond; {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:37:26,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:26,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:26,020 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} {1842#(<= (mod main_~B~0 4294967296) 100)} #85#return; {1858#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:26,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {1858#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:26,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:26,021 INFO L272 TraceCheckUtils]: 24: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,022 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:26,022 INFO L272 TraceCheckUtils]: 29: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,022 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:26,022 INFO L272 TraceCheckUtils]: 34: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,024 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1787#true} {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #91#return; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:26,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:26,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} assume !false; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:26,025 INFO L272 TraceCheckUtils]: 41: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} #87#return; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:26,025 INFO L272 TraceCheckUtils]: 46: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,026 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} #89#return; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} is VALID [2022-04-27 13:37:26,030 INFO L272 TraceCheckUtils]: 51: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 100))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:26,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:26,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {1955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1788#false} is VALID [2022-04-27 13:37:26,030 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-27 13:37:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 13:37:26,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:26,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-27 13:37:26,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {1955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1788#false} is VALID [2022-04-27 13:37:26,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:26,862 INFO L272 TraceCheckUtils]: 51: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:26,863 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #89#return; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:26,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,863 INFO L272 TraceCheckUtils]: 46: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,864 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #87#return; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:26,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:26,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:26,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:26,864 INFO L272 TraceCheckUtils]: 41: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:26,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:28,872 WARN L290 TraceCheckUtils]: 39: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 13:37:28,873 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1787#true} {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #91#return; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:28,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:28,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:28,873 INFO L272 TraceCheckUtils]: 34: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:28,873 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #89#return; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:28,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:28,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:28,875 INFO L272 TraceCheckUtils]: 29: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:28,875 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #87#return; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:28,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:28,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:28,876 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:28,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !false; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:28,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:28,876 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1787#true} {1787#true} #85#return; {1787#true} is VALID [2022-04-27 13:37:28,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#true} #81#return; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret6 := main(); {1787#true} is VALID [2022-04-27 13:37:28,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #101#return; {1787#true} is VALID [2022-04-27 13:37:28,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:28,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1787#true} is VALID [2022-04-27 13:37:28,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-27 13:37:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:37:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:28,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241064897] [2022-04-27 13:37:28,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:28,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825693530] [2022-04-27 13:37:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825693530] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:37:28,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:37:28,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-27 13:37:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152417945] [2022-04-27 13:37:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-27 13:37:28,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:28,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:30,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:30,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:30,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:30,926 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:36,002 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-27 13:37:39,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:37:42,266 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-27 13:37:44,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:37:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:45,649 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-27 13:37:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-27 13:37:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 13:37:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 13:37:45,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-27 13:37:47,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:47,717 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:37:47,717 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 13:37:47,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:37:47,717 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:47,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-27 13:37:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 13:37:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-27 13:37:47,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:47,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:47,737 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:47,737 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:47,739 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 13:37:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-27 13:37:47,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:47,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:47,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 74 states. [2022-04-27 13:37:47,740 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 74 states. [2022-04-27 13:37:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:47,742 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 13:37:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-27 13:37:47,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:47,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:47,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:47,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2022-04-27 13:37:47,745 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 55 [2022-04-27 13:37:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:47,745 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2022-04-27 13:37:47,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-27 13:37:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 13:37:47,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:47,746 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 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, 1, 1] [2022-04-27 13:37:47,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:37:47,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:47,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:47,947 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 1 times [2022-04-27 13:37:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:47,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126464785] [2022-04-27 13:37:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:47,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:47,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882791891] [2022-04-27 13:37:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:47,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:47,957 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-27 13:37:47,960 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-27 13:37:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:37:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:48,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:50,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {2493#true} call ULTIMATE.init(); {2493#true} is VALID [2022-04-27 13:37:50,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {2493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2493#true} is VALID [2022-04-27 13:37:50,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2493#true} {2493#true} #101#return; {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {2493#true} call #t~ret6 := main(); {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {2493#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {2493#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2493#true} {2493#true} #81#return; {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {2493#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L272 TraceCheckUtils]: 12: Hoare triple {2493#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {2493#true} ~cond := #in~cond; {2537#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:37:50,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2541#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:50,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {2541#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2541#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:50,166 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2541#(not (= |assume_abort_if_not_#in~cond| 0))} {2493#true} #83#return; {2548#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 13:37:50,166 INFO L272 TraceCheckUtils]: 17: Hoare triple {2548#(<= (mod main_~B~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,166 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2493#true} {2548#(<= (mod main_~B~0 4294967296) 100)} #85#return; {2548#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 13:37:50,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#(<= (mod main_~B~0 4294967296) 100)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,167 INFO L272 TraceCheckUtils]: 24: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,168 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2493#true} {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #87#return; {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,168 INFO L272 TraceCheckUtils]: 29: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,169 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2493#true} {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #89#return; {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,169 INFO L272 TraceCheckUtils]: 34: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,170 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2493#true} {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #91#return; {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,171 INFO L272 TraceCheckUtils]: 41: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,171 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2493#true} {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #93#return; {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,172 INFO L272 TraceCheckUtils]: 46: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:50,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:50,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:50,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:50,172 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2493#true} {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #95#return; {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !(1 != ~p~0 % 4294967296); {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:50,173 INFO L272 TraceCheckUtils]: 52: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 100) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:50,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:50,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {2663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2494#false} is VALID [2022-04-27 13:37:50,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {2494#false} assume !false; {2494#false} is VALID [2022-04-27 13:37:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 13:37:50,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:51,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {2494#false} assume !false; {2494#false} is VALID [2022-04-27 13:37:51,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {2663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2494#false} is VALID [2022-04-27 13:37:51,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:51,465 INFO L272 TraceCheckUtils]: 52: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:51,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !(1 != ~p~0 % 4294967296); {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:51,466 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2493#true} {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #95#return; {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:51,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L272 TraceCheckUtils]: 46: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2493#true} {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #93#return; {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:51,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,466 INFO L272 TraceCheckUtils]: 41: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !false; {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:51,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:51,468 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2493#true} {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:51,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L272 TraceCheckUtils]: 34: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2493#true} {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:51,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,468 INFO L272 TraceCheckUtils]: 29: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,470 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2493#true} {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:51,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,471 INFO L272 TraceCheckUtils]: 24: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:51,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2493#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:37:51,472 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2493#true} {2493#true} #85#return; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {2493#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2493#true} {2493#true} #83#return; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L272 TraceCheckUtils]: 12: Hoare triple {2493#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {2493#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2493#true} {2493#true} #81#return; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {2493#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {2493#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2493#true} call #t~ret6 := main(); {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2493#true} {2493#true} #101#return; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:37:51,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {2493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2493#true} is VALID [2022-04-27 13:37:51,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {2493#true} call ULTIMATE.init(); {2493#true} is VALID [2022-04-27 13:37:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:37:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:51,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126464785] [2022-04-27 13:37:51,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:51,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882791891] [2022-04-27 13:37:51,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882791891] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:37:51,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:37:51,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:37:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228831968] [2022-04-27 13:37:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-27 13:37:51,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:51,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:51,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:51,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:51,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:37:51,514 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:56,732 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2022-04-27 13:37:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:56,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-27 13:37:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:37:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:37:56,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:37:56,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:56,792 INFO L225 Difference]: With dead ends: 77 [2022-04-27 13:37:56,793 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 13:37:56,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:56,793 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:56,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 13:37:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 13:37:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 13:37:56,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:56,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:56,800 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:56,800 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:56,802 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-27 13:37:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 13:37:56,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:56,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:56,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-27 13:37:56,802 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-27 13:37:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:56,804 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-27 13:37:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 13:37:56,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:56,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:56,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:56,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:37:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-27 13:37:56,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 56 [2022-04-27 13:37:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:56,806 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-27 13:37:56,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:37:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 13:37:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 13:37:56,807 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:56,807 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-27 13:37:56,825 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-27 13:37:57,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:57,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 1 times [2022-04-27 13:37:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:57,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300851540] [2022-04-27 13:37:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:57,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:57,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080876384] [2022-04-27 13:37:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:57,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:57,033 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-27 13:37:57,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process